Need to write the following functions in table.cpp, and add function prototypes
ID: 2246626 • Letter: N
Question
Need to write the following functions in table.cpp, and add function prototypes for them to table.h and invoke the functions in main.cpp.
* int sumOfNodes(node * root)
Recursively calculate the sum of all the nodes in the tree.
* void copyLeaf(node * src, node *& dest)
Recursively copy all the leaves from the source tree to the destination tree. The destination tree must be a binary search
tree.
--------------------------------------------------------------------------------------------
main.cpp
#include "table.h"
#include <iostream>
using namespace std;
int main()
{
node * root = NULL;
build(root);
display(root);
/* PLACE YOUR FUNCTION CALL HERE */
display(root);
destroy(root);
return 0;
}
-----------------------------------------------------------------
table.h
#ifndef TABLE_H
#define TABLE_H
//table.h
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;
struct node
{
int data;
node * left;
node * right;;
};
void build(node * & root); //supplied
void display(node * root); //supplied
void destroy(node * & root); //supplied
/* ************** PLACE YOUR PROTOTYPE HERE ***************** */
#endif
------------------------------------------------------------
table.cpp
#include "table.h"
//Please put the impelementation of the required functions here
----------------------------------------------------------------------------------------
Please make sure the functions are done recursively, and are done in C++
Explanation / Answer
#include "table.h"
#include <iostream>
using namespace std;
int main()
{
node * root = NULL;
build(root);
display(root);
display(root);
destroy(root);
return 0;
}
#ifndef TABLE_H
#define TABLE_H
//table.h
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;
struct node
{
int data;
node * left;
node * right;;
};
void build(node * & root); //supplied
void display(node * root); //supplied
void destroy(node * & root); //supplied
static Node Insert(Node root,int value)
{
if(root == null){
root = new Node();
root.data= value ;
return root;
}
else{
if(value<root.data)
return Insert(root.left,value);
else if(value > root.data)
return Insert(root.right,value);
else return null;
}
end if
#include "table.h"
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.