Answer to Question #20051 in C++ for eshrat fatima
Make a binary search tree by using these elements:
23, 8, 42, 4, 16, 19
The resultant tree would b as follows:
a) Delete the node with value 8 from above tree. After deletion rearrange the tree and show the entries of the tree by using INORDER traversal
[Hint] Make a Search function to find the value to be deleted from the tree.
I. Use the template of code which you have practiced in Lab otherwise it will not be accepted.
II. It is not necessary to take the values from user; you can give static values in code as we have done in Binary tree. (But you can get Bonus marks by making this code dynamic.)
III. Before starting your work make sure that it is Binary Search Tree, not binary tree so you have to take care of the order of each insertion. Code of binary search tree insertion is given in your slides you can take help from there.
IV. In case of any confusion you people can discuss but before the deadline. After that no excuse will be entertained.
Unfortunately, your question requires a lot of work and cannot be done for free. Submit it with all requirements as an assignment to our control panel and we'll assist you.