in-order traversal

Visiting a binary tree's left subtree, then the node itself, then its right subtree.

In more detail

On a binary search tree, in-order traversal produces the keys in ascending sorted order. That makes it a quick correctness check after inserts and deletes: if the output is not sorted, the tree is broken.

Related terms

Taught in

References