26.3. Comparative Analysis of Data Structures

Try these first

1. 1.

   What is the average time complexity for searching in a Binary Search Tree?

   Hint

   Think about how many comparisons are made as you traverse down the tree.

2. 2.

   What is a Min-Heap?

   Hint

   Consider what this means for the root node.

3. 3.

   What is the average time complexity for searching in a Binary Search Tree?

   • O(n)
   • O(log n)
   • O(n log n)

   Hint

   Consider how the tree branches divide the numbers.

4. 4.

   True or False: An AVL Tree can have a balance factor greater than 1.

   • True
   • False

   Hint

   Think about what it means for a tree to be balanced.

5. 5.

   Given a dataset of patient records, how would you choose between using a Trie or a Binary Search Tree for storing patient names?

   Hint

   Think about the operations you need most frequently.

6. 6.

   You need to implement a scheduling system that requires dynamically prioritized tasks. Which data structure would you utilize and why?

   Hint

   Consider how quickly you need to access the highest or lowest priority item.