Question

uhayDownloads/ab%2010.pdf Lab 10 Fall 2017 Eric May struct TreeNode string word TreeNode left, right Note: A lot of your work from lab 9 can be reused or repurposed. Remember that working with a partner is encouraged Using Classes Define a Tree class suitable for holding the Node struct defined above. I have provided a header file and the obj that accompanies it so you can see how a binary search tree is supposed to function, simply put both files into your project directory (where you've gotten your submission file all semester) I did not provide a main; just test your functions until you're satisfied I will provide a main to test your code, it will use all of your relevant functions appropriately if you use the included header file. If you do not use the provided header, you must provide a main file that presents the following menu to the user 1. a. Add an item (asks user for item) b. Find an item (asks user for item) c. Show two stats for our current tree: number of nodes and maximum depth d. Display tree after asking user to choose from pre, in, or post order traversal e. Destroy the tree f. Destroy the tree and exit 2 Return to step 2 if user did not choose f There is a header file with suggested method declarations included. Pn

Answer 1

#include<iostream>
#include<stdlib.h>
#include<conio.h>
#include <string.h>
using namespace std;

//Structure definition
struct BinaryTreeNode
{
//Structure member
string value;
BinaryTreeNode *left;
BinaryTreeNode *right;
};//End of structure

//Returns the node having minimum value
BinaryTreeNode* FindMin(BinaryTreeNode *tnode)
{
//Checks if tree is empty
if(tnode == NULL)
{
//There is no element in the tree
return NULL;
}
//Go to the left sub tree to find the min element
if(tnode -> left)
return FindMin(tnode -> left);
else
return tnode;
}//End of function

//Insert a node
BinaryTreeNode *Insert(BinaryTreeNode *tnode, string value)
{
//Checks if tree is empty
if(tnode == NULL)
{
//Creates a temporary pointer
BinaryTreeNode *temp;
temp = new BinaryTreeNode;
temp -> value = value;
//Initializes left and right node to null
temp -> left = temp -> right = NULL;
return temp;
}//End of if
//Checks if the entered value is greater than the current node value
if(value.compare(tnode -> value) > 0)
{
//Insert the node at right
tnode -> right = Insert(tnode -> right, value);
}//End of if
//Checks if the entered value is less than the current node value
else if(value.compare(tnode -> value) < 0)
{
//Insert the node at left
tnode -> left = Insert(tnode -> left, value);
}//End of else if
//Else there is nothing to do as the data is already in the tree.
return tnode;
}//End of function

//Function to delete a node from tree
BinaryTreeNode * Delete(BinaryTreeNode *tnode, string value)
{
//Creates a temporary pointer
BinaryTreeNode *temp;
//Checks if tree is empty
if(tnode == NULL)
{
cout<<"Element Not Found";
}//End of if
//Checks if the entered value is less than the current node value
else if(value.compare(tnode -> value) < 0)
{
tnode -> left = Delete(tnode -> left, value);
}// End of else if condition
//Checks if the entered value is greater than the current node value
else if(value.compare(tnode -> value) > 0)
{
tnode -> right = Delete(tnode -> right, value);
}// End of else
else
{
//Now We can delete this node and replace with either minimum element in the right sub tree or maximum element in the left subtree
if(tnode -> right && tnode -> left)
{
//Here we will replace with minimum element in the right sub tree
temp = FindMin(tnode -> right);
tnode -> value = temp -> value;

//As we replaced it with some other node, we have to delete that node
tnode -> right = Delete(tnode -> right, temp -> value);
}// End of if condition
else
{
//If there is only one or zero children then we can directly remove it from the tree and connect its parent to its child
temp = tnode;
if(tnode -> left == NULL)
tnode = tnode -> right;
else if(tnode -> right == NULL)
tnode = tnode -> left;
//Delete temp
free(temp);
}//End of inner else
}//End of outer else
// Returns the node
return tnode;
}//End of function

//Inorder traversal
void Inorder(BinaryTreeNode *tnode)
{
//Checks if tree is empty
if(tnode == NULL)
return;
//Recursively calls the left child node
Inorder(tnode -> left);
//Displays data
cout<<tnode -> value<<" ";
//Recursively calls the right child node
Inorder(tnode -> right);
}//End of function

//Pre order traversal
void Preorder(BinaryTreeNode *tnode)
{
//Checks if tree is empty
if(tnode == NULL)
return;
//Displays data
cout<<tnode -> value<<" ";
//Recursively calls the left child node
Preorder(tnode -> left);
//Recursively calls the right child node
Preorder(tnode -> right);
}//End of function

//Post order traversal
void Postorder(BinaryTreeNode *tnode)
{
//Checks if tree is empty
if(tnode == NULL)
return;
//Recursively calls the left child node
Postorder(tnode -> left);
//Recursively calls the right child node
Postorder(tnode -> right);
//Displays data
cout<<tnode -> value<<" ";
}//End of function

//Returns depth of the tree
int depth(BinaryTreeNode *tnode)
{
//Checks if tree is empty
if (tnode == NULL)
return 0;
//Recursively calls the function to calculate depth
return max( depth(tnode->left), depth(tnode->right) ) + 1;
}// End of function

// Returns number of nodes in the tree
int numberOfNodes(BinaryTreeNode *tnode, int &counter)
{
//Checks if tree is empty
if(tnode == NULL)
{
return 0;
}// End of if condition
//Recursively calls the left child node
numberOfNodes(tnode -> left, counter);
//Recursively calls the right child node
numberOfNodes(tnode -> right, counter);
// Increase the node counter by one
counter++;
}// End of function

// Function to search a node in tree
void Find(BinaryTreeNode *tnode, string value, int &index)
{
//Checks if tree is empty
if(tnode == NULL)
{
return;
}// End of if condition
//Recursively calls the left child node
Find(tnode -> left, value, index);
//Recursively calls the right child node
Find(tnode -> right, value, index);
// Checks if the current node value is equals to the value passed as a parameter to search is equal
if(tnode -> value.compare(value) == 0)
{
// Display the node
cout<<"\n Found: "<<tnode -> value<<" ";
// Set the index to one
index = 1;
// return from the function
return;
}// End of if condition
}// End of function

//Main function
int main()
{
//Creates root and temporary node
BinaryTreeNode *root = NULL,*temp;
// To store the string value entered by the use for find, or delete, or insert
string val;
// To store found status or number of nodes
int counter;
// To store user choice
int ch;
//Loops till user choice is 8
while(1)
{
// Initializes counter to zero
counter = 0;
//Displays the menu
cout<<"\n 1) Insert \n 2) Find \n 3) Depth and Number of Nodes \n 4) In-order \n 5) Pre-order \n 6) Post-order \n 7) Delete \n 8) Exit\n";
//Accepts user choice
cout<<"Enter your choice: ";
cin>>ch;
//Checks the choice and calls appropriate function
switch(ch)
{
case 1:
cout<<"\n Enter the value to insert: ";
cin>>val;
root = Insert(root, val);
break;
case 2:
cout<<"\n Enter the value to find: ";
cin>>val;
Find(root, val, counter);
if(counter != 1)
cout<<"\n Not Found: "<<val;
break;
case 3:
numberOfNodes(root, counter);
cout<<"\n Number of nodes: "<<counter;
cout<<"\n Depth of the tree: "<<depth(root);
break;
case 4:
cout<<"\n Inorder Traversal: ";
Inorder(root);
break;
case 5:
cout<<"\n Preorder Traversal:: ";
Preorder(root);
break;
case 6:
cout<<"\n Postorder Traversal:: ";
Postorder(root);
break;
case 7:
cout<<"\n Enter the value to delete: ";
cin>>val;
root = Delete(root,val);
break;
case 8:
exit(0);
default:
cout<<"\n Invalid choice:";
}//End of switch
}//End of while
return 0;
}//End of main

Sample Run:

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 1

Enter the value to insert: check

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 1

Enter the value to insert: this

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 4

Inorder Traversal: check this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 5

Preorder Traversal:: check this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 6

Postorder Traversal:: this check
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 1

Enter the value to insert: again

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 4

Inorder Traversal: again check this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 5

Preorder Traversal:: check again this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 6

Postorder Traversal:: again this check
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 3

Number of nodes: 3
Depth of the tree: 2
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 2

Enter the value to find: hello

Not Found: hello
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 2

Enter the value to find: check

Found: check
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 1

Enter the value to insert: how

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 4

Inorder Traversal: again check how this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 3

Number of nodes: 4
Depth of the tree: 3
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 7

Enter the value to delete: how

1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 5

Preorder Traversal:: check again this
1) Insert
2) Find
3) Depth and Number of Nodes
4) In-order
5) Pre-order
6) Post-order
7) Delete
8) Exit
Enter your choice: 8