1.11. In-order Traversal

Try these first

1. 1.

   What is the traversal order of in-order traversal?

   Hint

   Think about which subtree is visited first.

2. 2.

   Describe a Binary Search Tree.

   Hint

   Focus on the arrangement of nodes.

3. 3.

   What is the result of in-order traversal on a BST?

   • Unsorted order
   • Sorted order
   • Random order

   Hint

   Think about the order of visiting left and right nodes.

4. 4.

   True or False: In-order traversal retrieves nodes from a binary search tree in descending order.

   • True
   • False

   Hint

   Consider the properties of binary search trees.

5. 5.

   Construct a binary search tree with the following numbers: 15, 10, 20, 8, 12, 16, 25, then perform an in-order traversal. What is the result?

   Hint

   Consider placement in the BST and remember the traversal order.

6. 6.

   If you were to build an application that needs to retrieve records in sorted order, how would you implement it using a binary search tree with in-order traversal?

   Hint

   Think about how these methods improve data handling.