1.8. Binary Tree Basics

Try these first

1. 1.

   What is a binary tree?

   Hint

   Think about how trees in nature branch out.

2. 2.

   What’s the difference between a binary tree and a binary search tree?

   Hint

   Consider how values are arranged in each structure.

3. 3.

   What does a binary search tree allow us to do efficiently?

   • A. Search for values
   • B. Only store values
   • C. Sort values in any order

   Hint

   Remember the main purpose of a BST.

4. 4.

   True or False: In a binary tree, each node can have more than two children.

   • True
   • False

   Hint

   Think about the definition of a binary tree.

5. 5.

   Construct a binary search tree from the following list of values: [7, 4, 9, 2, 6, 8, 10]. Then, perform an in-order traversal and list the returned values.

   Hint

   Start by placing the first value at the root and continue adding values based on their relation to existing nodes.

6. 6.

   Explain how the height of a binary search tree affects its efficiency during searching. Provide a scenario where the height is maximized.

   Hint

   Consider what happens when you insert elements in a non-random order.