- The goal of this activity is to understand how to search for a given value in a Binary Search Tree (BST).
- You will be given a value to search for (e.g., "Find 21").
- Always start at the root node of the tree (the topmost node).
-
At each step, compare the value you are searching for with the
value at the current node:
- If the value is less than the current node, go to the left child by clicking Left.
- If the value is greater than the current node, go to the right child by clicking Right.
- If the value matches the current node, you have found the node.
- Once you believe you have found the correct node, click Verify to check your answer.
- Click Next to try searching for a new value and practice again.
Find 21