Below binary program is usefell to you #include template class Tree { // Internal class which stores only Node related information. struct TreeNode { T data; TreeNode * left; TreeNode * right; TreeNode(T val):data(val),left(NULL),right(NULL) { } }; TreeNode * root; void print(TreeNode*); void freeMemory(TreeNode*); public: Tree(); ~Tree(); void insert(T); void print(); }; template Tree::Tree():root(NULL){} template Tree::~Tree() { freeMemory(root); } template void Tree::freeMemory(Tree::TreeNode *node) { if (node==NULL) return; if (node->left) freeMemory(node->left); if (root->right) freeMemory(node->right); delete node; } template //make it return value? void Tree::insert(T val) { TreeNode * treeNode = NULL; try { treeNode = new TreeNode(val); // handle exception necessary? } catch (std::bad_alloc &exception) { std::cerr << \"bad_alloc caught: \" << exception.what() << std::endl; EXIT_FAILURE; } TreeNode *temp=NULL; TreeNode *prev=NULL; temp = root; while(temp) { prev = temp; if (temp->data < treeNode->data) temp = temp->right; else temp = temp->left; } if (prev==NULL) root = treeNode; else { if (prev->datadata) prev->right = treeNode; // use setter function? else prev->left = treeNode; } } template void Tree::print(TreeNode *root) { if (root==NULL) return ; print(root->left); std::cout << root->data << std::endl; print(root->right); } template void Tree::print() { print(root); } int main() { Tree tree; tree.insert(14); tree.insert(12); tree.insert(6); tree.insert(17); tree.insert(8); tree.print(); } Solution Below binary program is usefell to you #include template class Tree { // Internal class which stores only Node related information. struct TreeNode { T data; TreeNode * left; TreeNode * right; TreeNode(T val):data(val),left(NULL),right(NULL) { } }; TreeNode * root; void print(TreeNode*); void freeMemory(TreeNode*); public: Tree(); ~Tree(); void insert(T); void print(); }; template Tree::Tree():root(NULL){} template Tree::~Tree() { freeMemory(root); } template void Tree::freeMemory(Tree::TreeNode *node) { if (node==NULL) return; if (node->left) freeMemory(node->left); if (root->right) freeMemory(node->right); delete node; } template //make it return value? void Tree::insert(T val) { TreeNode * treeNode = NULL; try { treeNode = new TreeNode(val); // handle exception necessary? } catch (std::bad_alloc &exception) { std::cerr << \"bad_alloc caught: \" << exception.what() << std::endl; EXIT_FAILURE; } TreeNode *temp=NULL; TreeNode *prev=NULL; temp = root; while(temp) { prev = temp; if (temp->data < treeNode->data) temp = temp->right; else temp = temp->left; } if (prev==NULL) root = treeNode; else { if (prev->datadata) prev->right = treeNode; // use setter function? else prev->left = treeNode; } } template void Tree::print(TreeNode *root) { if (root==NULL) return ; print(root->left); std::cout << root->data << std::endl; print(root->right); } template void Tree::print() { print(root); } int main() { Tree tree; tree.insert(14); tree.insert(12).

1. Below binary program is usefell to you
#include
template
class Tree
{
// Internal class which stores only Node related information.
struct TreeNode
{
T data;
TreeNode * left;
TreeNode * right;
TreeNode(T val):data(val),left(NULL),right(NULL)
{
}
};
TreeNode * root;
void print(TreeNode*);
void freeMemory(TreeNode*);
public:
Tree();
~Tree();
void insert(T);
void print();
};
template
Tree::Tree():root(NULL){}
template
Tree::~Tree()

2. {
freeMemory(root);
}
template
void Tree::freeMemory(Tree::TreeNode *node)
{
if (node==NULL)
return;
if (node->left)
freeMemory(node->left);
if (root->right)
freeMemory(node->right);
delete node;
}
template
//make it return value?
void Tree::insert(T val)
{
TreeNode * treeNode = NULL;
try
{
treeNode = new TreeNode(val); // handle exception necessary?
} catch (std::bad_alloc &exception)
{
std::cerr << "bad_alloc caught: " << exception.what() << std::endl;
EXIT_FAILURE;
}
TreeNode *temp=NULL;
TreeNode *prev=NULL;
temp = root;
while(temp)
{
prev = temp;

3. if (temp->data < treeNode->data)
temp = temp->right;
else
temp = temp->left;
}
if (prev==NULL)
root = treeNode;
else
{
if (prev->datadata)
prev->right = treeNode; // use setter function?
else
prev->left = treeNode;
}
}
template
void Tree::print(TreeNode *root)
{
if (root==NULL)
return ;
print(root->left);
std::cout << root->data << std::endl;
print(root->right);
}
template
void Tree::print()
{
print(root);
}
int main()
{
Tree tree;
tree.insert(14);
tree.insert(12);
tree.insert(6);
tree.insert(17);

4. tree.insert(8);
tree.print();
}
Solution
Below binary program is usefell to you
#include
template
class Tree
{
// Internal class which stores only Node related information.
struct TreeNode
{
T data;
TreeNode * left;
TreeNode * right;
TreeNode(T val):data(val),left(NULL),right(NULL)
{
}
};
TreeNode * root;
void print(TreeNode*);
void freeMemory(TreeNode*);
public:
Tree();
~Tree();
void insert(T);
void print();
};

5. template
Tree::Tree():root(NULL){}
template
Tree::~Tree()
{
freeMemory(root);
}
template
void Tree::freeMemory(Tree::TreeNode *node)
{
if (node==NULL)
return;
if (node->left)
freeMemory(node->left);
if (root->right)
freeMemory(node->right);
delete node;
}
template
//make it return value?
void Tree::insert(T val)
{
TreeNode * treeNode = NULL;
try
{
treeNode = new TreeNode(val); // handle exception necessary?
} catch (std::bad_alloc &exception)
{
std::cerr << "bad_alloc caught: " << exception.what() << std::endl;
EXIT_FAILURE;
}
TreeNode *temp=NULL;

6. TreeNode *prev=NULL;
temp = root;
while(temp)
{
prev = temp;
if (temp->data < treeNode->data)
temp = temp->right;
else
temp = temp->left;
}
if (prev==NULL)
root = treeNode;
else
{
if (prev->datadata)
prev->right = treeNode; // use setter function?
else
prev->left = treeNode;
}
}
template
void Tree::print(TreeNode *root)
{
if (root==NULL)
return ;
print(root->left);
std::cout << root->data << std::endl;
print(root->right);
}
template
void Tree::print()
{
print(root);
}
int main()
{

7. Tree tree;
tree.insert(14);
tree.insert(12);
tree.insert(6);
tree.insert(17);
tree.insert(8);
tree.print();
}