15.. Find Operations

Try these first

1. 1.

   What is the minimum value in a BST with root 10, left child 5, and left child 2?

   Hint

   Look for the leftmost node.

2. 2.

   What is the maximum value in a BST with root 15 and right child 20?

   Hint

   Follow the right child till you cannot go further.

3. 3.

   What is the minimum value in a BST that has the following nodes: 10, 5, 3, 1?

   • 1
   • 3
   • 5
   • 10

   Hint

   Always look left to find the minimum.

4. 4.

   True or False: A node's successor can only be found in its right subtree.

   • True
   • False

   Hint

   Consider the conditions under which a successor exists.

5. 5.

   Consider a BST structured with values: 10, 6, 15, 3, 8, 12, 18. Find the successor and predecessor of the value 10.

   Hint

   Use tree traversal techniques discussed to explore each side.

6. 6.

   Write an algorithm to find the minimum and maximum values in a BST with nodes inserted in random order. Call your algorithm on a sample BST.

   Hint

   Follow the path based on node directions to fetch limited value ranges.