← All tree operations
Inorder Traversal
VisitingVisited
binary search tree
left is smaller, right is larger
50
30
70
20
40
60
80
pseudocode
inorder(node)if node is null: returninorder(node.left)visit(node)inorder(node.right)
output
nothing visited yet
Frame 1 / 16
Starting tree
7 values inserted
4
3–9 unique integers, 1–99 each — inserted in order to build the starting tree.