Binary Tree - Part 6

How many comparisons does it take, in the worst case, to find a target value in a * BST with h levels? A. h B. 2h C. 2h1 D. 2h1 A B C D The method add below adds value to the binary search tree rooted at root and returns the root of the newtree. Which of the following can replace ? private Ireenode add(Treenode root, object value) if (root == nul1) Ioot = new Treenode (value ) else [ int diff = (\{Comparablecobject > ) value) . compareTo (root.getValue ( ) ); if (diff 1 return root; root = add(root, value); add(root.getLeft(), value); add(root.getRight(), value); root.setLeft(add(root.getLeft(), value))