1.6. Data Structures Comparison

Try these first

1. 1.

   What is a search tree?

   Hint

   Think about how data is organized in a tree structure.

2. 2.

   What is the advantage of using a min-heap?

   Hint

   Consider what happens at the root of a min-heap.

3. 3.

   What data structure allows quick access to the minimum element?

   • Max Heap
   • Min Heap
   • Binary Search Tree

   Hint

   Think about where the smallest value is located.

4. 4.

   True or False: Binary search trees require that all values on the left of a node are larger.

   • True
   • False

   Hint

   Recall the property of binary search trees.

5. 5.

   Given a series of flight requests with times, how would you design a data structure to handle both insertion and separation constraints efficiently?

   Hint

   Think about balancing operations and their significance.

6. 6.

   If you were to implement operations on a sorted array, how would the time complexities compare to those of a binary search tree for the same sequence of operations?

   Hint

   Reflect on how elements shift in an array.