15.2. Finding the Maximum

Try these first

1. 1.

   What is the minimum value in the BST if the root is 10 and the leftmost path goes 10 -> 8 -> 5?

   Hint

   Follow the left path to the end.

2. 2.

   Find the maximum value in a BST where the root is 15 and it has a right child that goes 15 -> 20 -> 25.

   Hint

   Move right until you can’t.

3. 3.

   What is the process to find the minimum value in a binary search tree?

   Hint

   Think about moving left in the tree.

4. 4.

   True or False: The maximum value in a BST is found at the leftmost node.

   • True
   • False

   Hint

   Consider the structure of a binary search tree.

5. 5.

   Given a complex BST with values 20, 15, 30, 10, 18, 25, 35, list down the traversal steps to find both the minimum and maximum values.

   Hint

   Follow the left path for minimum and right for maximum.

6. 6.

   In a binary search tree, how would finding the successor of a node placed at the bottom level with no right child differ from someone positioned higher up with a right child?

   Hint

   Visualize the tree and explore different paths.