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 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