B 4.1.4 Worksheet 2
Name: _________________________ Consider the following Binary Search Tree: 50 / \ 30 70 / \ / \ 20 40 60 80 / \ 5 45 1. Tree Traversals: Write the sequence of nodes visited for each traversal type. 2. Searching: For each value below, list the sequence of nodes you would visit to find it. If the value is not in the tree, state "Not Found". 3. Thinking Question: What is special about the output of the in-order...