1.

With the help of diagrams construct a Binary Search Tree (BST) with the following keys: 86, 12, 42, 69, 38, 57, 74, 6, 49, 71. Also delete 42 from the constructed BST.

Answer»

Construct bst
and delete 42 by moving to the RIGHT of 42 and then LEFT until you REACH a leaf
replace 42 with leaf



Discussion

No Comment Found