1 bst search a draw the binary search tree t which has the following pre order trave 5346401
1. BST Search. |
(a) Draw the binary search tree T which has the following pre-order traversal. preorder: 9, 8, 6, 7, 15, 11, 10, 14, 13 |
(b) Print the value of x.key if x = nil everytime the function Tree-Search(x,k) is called when processing Tree-Search(T.root,12). |