1. Search Trees

Try these first

1. 1.

   What is a Search Tree?

   Hint

   Think about how it helps in sorting and searching.

2. 2.

   Define a Binary Search Tree.

   Hint

   Consider how values are arranged.

3. 3.

   What is the primary characteristic of a Binary Search Tree?

   • All nodes are connected in a linear manner
   • Left child nodes are always greater than the parent
   • Left child nodes are always smaller than the parent

   Hint

   Think about how nodes are arranged based on values.

4. 4.

   True or False: In-order traversal of a BST results in values in non-decreasing order.

   • True
   • False

   Hint

   Recall the traversal process.

5. 5.

   Design a Binary Search Tree from the following sequence of numbers: 15, 10, 20, 8, 12, 17, 25. What would the tree look like?

   Hint

   Insert numbers one at a time, following left for lesser and right for greater.

6. 6.

   How would you execute a deletion of node 10 from the BST created from the previous problem, considering it has two children?

   Hint

   Think of maintaining BST integrity while deleting.