26.1. Trees

Try these first

1. 1.

   What is the topmost node of a tree called?

   Hint

   Think of where the tree begins.

2. 2.

   What do you call a node that has no children?

   Hint

   Consider what happens if you can't go further down from that point.

3. 3.

   What defines a node as a leaf in a tree structure?

   • A node with multiple children
   • A node with no children
   • A root node

   Hint

   Remember the basic structure of tree nodes.

4. 4.

   True or False: In a binary search tree, the left subtree contains values greater than the parent node.

   • True
   • False

   Hint

   Recall how values are organized in a binary search tree.

5. 5.

   Consider the following set of numbers: 15, 10, 20, 8, 12, 17, 25. Construct a binary search tree and demonstrate the in-order traversal output.

   Hint

   Focus on the rules of left and right placements based on value.

6. 6.

   Explain how you would implement a priority queue using a heap. What advantages does using a heap provide?

   Hint

   Consider the properties of heaps regarding parent and child relationships.