1.1. Introduction to Search Trees

Try these first

1. 1.

   What is a search tree?

   Hint

   Think about how data is organized for quick retrieval.

2. 2.

   Define a min heap.

   Hint

   Consider how this structure allows easy access to the smallest element.

3. 3.

   What is the main characteristic of a min heap?

   • The smallest element is always the left child.
   • The largest element is always the root.
   • The smallest element is always at the root.

   Hint

   Think about where you'd find the minimum value in a collection.

4. 4.

   True or False: A binary search tree can have duplicate values.

   • True
   • False

   Hint

   Recall the property of how elements are organized in a BST.

5. 5.

   Construct a binary search tree from the numbers 10, 15, 5, 3, 12. Then perform both insert and delete operations, documenting changes to the tree at each step.

   Hint

   Visualize each insertion and deletion to see how it affects the tree’s structure.

6. 6.

   You are given an unordered list of times [16:00, 16:30, 15:30, 15:45]. Design a search tree. How would you perform an in-order traversal and what would the outcome be?

   Hint

   Remember to always begin with the smallest value on the left when constructing your tree.