Skip to main content

Tree Traversal - Inorder

Learn Tree Traversal - Inorder (Trees, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Inorder: Left &rarr; Root &rarr; Right Recurse left FIRST, then visit the current node, then recurse right. The single most important fact about inorder: on a Binary Search Tree , inorder traversal visits nodes in SORTED ASCENDING order - a direct consequence of the BST property (left < node < right) applied recursively.

More lessons in Trees