Inorder traversal
Left subtree, then the node, then the right subtree. inOrder calls itself on the left child first, so a node is added only once everything to its left is done; the call stack shows the calls still waiting.
Left subtree, then the node, then the right subtree. inOrder calls itself on the left child first, so a node is added only once everything to its left is done; the call stack shows the calls still waiting.