Question

Detailed Specification: Write six basic functions for the BST: Insert, Delete, Search, Find max, Find min, and Print_BST 1. Search(x): Find out the index that stores element x using binary search tree mechanism. Print out all the elements in the search path. 2. Find max(): Find and print maximum value in BST 3. Find min): Find and print minimum value in BST 4. Print BST: Print out the BST structure in the form of array with index 5. Insert(x): Insert a value element x into BST 6. (BOUNS) Delete(x): Delete element x in BST including ALL 3 situation:s we discussed After you finished the all functions, following are the things you need to carry out 1. Insert(5) 2. Insert(8) 3. Insert(3) 4. Insert(1) 5. Insert(4) 6. Insert(9) 7. Insert(18) 8. Insert (20) 9. Insert(19) 10. Insert(2) 11. Perform Print_BSTO 12. Perform Find max() 13. Perform Find min() 14. Perform Search(3) in the BST 15. Perform Search(18) in the BST 16. Perform Search(19) in the BST 17. Delete(19) in the BST, perform Print BSTO (BOUNS) 18. Delete(2) in the BST, perform Print BSTO (BOUNS) 19. Delete(8) in the BST, perform Print BSTO (BOUNS) 20. Delete(3) in the BST, perform Print BSTO (BOUNS) 21. Delete(5) in the BST, perform Print_BSTO (BOUNS) (p.s. Although the input values are provided, your code should be able to handle random input values.)

***************************************PLEASE USE AN ARRAY NOT A POINTER********************************************

Answer 1

EXECUTABLE CODE:

#include <iostream>

#include <stdlib.h>

using namespace std;

typedef struct node

{

int data;

struct node* left;

struct node* right;

}BST;

BST* insert(int val) //this function creates a node

{

BST* node = (BST*)malloc(sizeof(BST));

node->data = val;

node->left = NULL;

node->right = NULL;

return node;

}

BST nodeInsert(BST root, int val)

{

if(root == NULL)

return insert(val); //if root is null then creates a node

if(val < root->data)

root->left = nodeInsert(root->left, val); //creates nodeat left subtree if value is less than root

else

root->right = nodeInsert(root->right, val); //creates nodeat right subtree if value is greater than root

return root;

}

BST deleteNode(BST root, int val)

{

if (root == NULL)

return root; //if root is null return null

if (val < root->data)

root->left = deleteNode(root->left, val); //if search valis less than root, then traverse left subtree

else if (val > root->data)

root->right = deleteNode(root->right, val); //if searchval is greater than root, then traverse right subtree

else

{

if (root->left == NULL) //swaps the root->right withcurrent node

{

BST *temp = root->right;

free(root);

return temp;

}

else if (root->right == NULL) //swaps root->left withcurrent node

{

BST *temp = root->left;

free(root);

return temp;

}

BST* temp = root->right;

while (temp->left != NULL)

temp = temp->left;

root->data = temp->data;

root->right = deleteNode(root->right, temp->data);

}

return root;

}

int findMin(BST* root)

{

BST *temp = root;

while(temp->left)

temp = temp->left;

return temp->data;

}

int findMax(BST* root)

{

BST *temp = root;

while(temp->right)

temp = temp->right;

return temp->data;

}

void printInorder(BST* root) //preorder traversal to printtree

{

if(root == NULL) return;

printInorder(root->left);

cout<<root->data <<" ";

printInorder(root->right);

}

int search(BST* root, int val)

{

if (root == NULL)

return 0;

if (root->data == val)

return 1;

if (root->data < val)

return search(root->right, val);

return search(root->left, val);

}

int main()

{

BST* root = NULL;

root = insert(5); //adding root element

nodeInsert(root,8); //adding element to existing tree

nodeInsert(root,3);

nodeInsert(root,1);

nodeInsert(root,4);

nodeInsert(root,9);

nodeInsert(root,18);

nodeInsert(root,20);

nodeInsert(root,19);

nodeInsert(root,2);

cout << "INORDER : ";

printInorder(root);

cout << endl;

int min = findMin(root);

int max = findMax(root);

cout << "Minimum element is : " << min <<endl;

cout << "Maximum element is : " << max <<endl;

if(search(root, 3))

cout << "Found" << endl;

else

cout << "Not found" << endl;

if(search(root, 18))

cout << "Found" << endl;

else

cout << "Not found" << endl;

if(search(root, 19))

cout << "Found" << endl;

else

cout << "Not found" << endl;

root = deleteNode(root, 19);

printInorder(root);

cout << endl;

root = deleteNode(root, 2);

printInorder(root);

cout << endl;

root = deleteNode(root, 8);

printInorder(root);

cout << endl;

root = deleteNode(root, 3);

printInorder(root);

cout << endl;

root = deleteNode(root, 5);

printInorder(root);

cout << endl;

return 0;

}

OUTPUT: