Skip to content

Glossary: Data Structures and Algorithms

In-order traversal

Also written: pre-order traversal, pre-order

Visiting a binary tree's left subtree, then the node, then the right subtree. In a BST this gives the values in sorted order. A pre-order traversal visits the node first.

Where the book teaches it

Related terms

TraversalBinary search tree (BST)