1.5. Predecessor and Successor

Try these first

1. 1.

   Define a predecessor in the context of search trees.

   Hint

   Think of it as the nearest smaller number in an arranged list.

2. 2.

   What is a successor in a search tree?

   Hint

   Consider it as the nearest larger number in a sorted list.

3. 3.

   What is the function of a predecessor in a search tree?

   • It is the largest value
   • It is the smallest value
   • It is the closest smaller value
   • It is the closest larger value

   Hint

   Look for what 'pre-' could signify.

4. 4.

   True or False: A min heap can effectively manage minimum separation constraints.

   • True
   • False

   Hint

   Think about how elements are retrieved in the heap.

5. 5.

   Create an algorithm using a binary search tree structure to manage a list of flight requests defined by their arrival times, ensuring that any new request complies with a minimum separation rule of 3 minutes.

   Hint

   Think about tree properties and how they facilitate minimum separation checks.

6. 6.

   Evaluate the performance difference in time complexities between a direct heap implementation and a balanced binary search tree when managing a large number of flight requests.

   Hint

   Which structure allows fast access to elements based on valued relationships?