1.9. Node Terminology

Try these first

1. 1.

   What is a search tree?

   Hint

   Think about how data is prioritized.

2. 2.

   Describe what a min heap is.

   Hint

   Focus on parent-child relationships.

3. 3.

   What is a characteristic of a Binary Search Tree?

   • Every node has two children
   • Left children are smaller than the parent node
   • It must be completely filled

   Hint

   Think about how values are structured.

4. 4.

   A min heap allows retrieval of which element efficiently?

   • True
   • False

   Hint

   Recall the properties of a min heap.

5. 5.

   Design a scenario where air traffic control fails due to an unbalanced data structure in managing takeoff and landing times. Explain why it fails.

   Hint

   Consider how priorities might be mismanaged.

6. 6.

   Given this series of values - [10, 20, 5, 6, 15], construct a binary search tree and give its in-order and pre-order traversals.

   Hint

   Only follow the BST rules while adding values.