26.1.2. Binary Trees

Try these first

1. 1.

   What is a binary tree?

   Hint

   Think about the structure and children of each node.

2. 2.

   Name one traversal method for binary trees.

   Hint

   Recall the traversal methods we've discussed.

3. 3.

   Which traversal method processes the left child, the node, then the right child?

   • Pre-order
   • Post-order
   • In-order

   Hint

   Think about the order in which we deal with nodes.

4. 4.

   True or False: In a binary tree, each node must have exactly two children.

   • True
   • False

   Hint

   Consider the conditions of the tree structure.

5. 5.

   Given the binary tree with nodes A, B, C, D in a certain structure, if you perform a pre-order traversal, what will be the output?

   Hint

   Remember the order of visiting nodes in pre-order.

6. 6.

   Create a binary tree and demonstrate all four types of traversal methods on the tree.

   Hint

   Build the structure first, then systematically apply each traversal technique.