in c++
Draw the tree after the insertion of keys 33, 31, 60,90,86,81,96,87,94, 21, 11 and 18, in this order.
Consider the above values and perform The Following:
1) Write code for Insertion of above values in trees.
2) perform Breadth First Search AND Depth First Search and display results.
3) Perform Preorder, in order, and post order traversal and show the outputs.
4) Write a code to delete 87 and 21, and 90 from above tree.