1.Previous
3.Next

of a binary expression tree.

In-order, LNR

# Recursively traverse the current node's left subtree.
# Visit the current node (in the figure: position green).
# Recursively traverse the current node's right subtree.

In a binary search tree ordered such that in each node the key is greater than all keys in its left subtree and less than all keys in its right subtree, in-order traversal retrieves the keys in ascending sorted

1.Previous
3.Next