Glossary: Data Structures and Algorithms in Rust

In-order traversal

Also written: pre-order traversal, in order

A walk that visits the left subtree, then the node, then the right subtree. In a BST that gives the values in sorted order. Pre-order visits the node before its subtrees.