Walk this tree in inorder order: left subtree, then the node, then the right subtree.
A binary search tree with 7 nodes. Walking it in inorder order, which visits left subtree, then the node, then the right subtree.
20 has nothing to its left, so it is written down first.
Visiting 20, number 1 of 7. The order so far is 20.
Everything to the left of 30 is done, so 30 is written down now.
Visiting 30, number 2 of 7. The order so far is 20, 30.
40 is a leaf, so there is nothing below it to do first.
Visiting 40, number 3 of 7. The order so far is 20, 30, 40.
Everything to the left of 50 is done, so 50 is written down now.
Visiting 50, number 4 of 7. The order so far is 20, 30, 40, 50.
60 is a leaf, so there is nothing below it to do first.
Visiting 60, number 5 of 7. The order so far is 20, 30, 40, 50, 60.
Everything to the left of 70 is done, so 70 is written down now.
Visiting 70, number 6 of 7. The order so far is 20, 30, 40, 50, 60, 70.
80 is a leaf, so there is nothing below it to do first. That is the last one.
Visiting 80, number 7 of 7. The order so far is 20, 30, 40, 50, 60, 70, 80.
The inorder walk is 20, 30, 40, 50, 60, 70, 80. Inorder on a search tree always comes out sorted.
The inorder traversal visited 20, 30, 40, 50, 60, 70, 80.