Glossary: Data Structures and Algorithms in Rust

Traversal

Also written: traverse

Visiting every node in turn, such as following a linked list's links until None, or walking a tree. In-order gives a BST's values sorted, and pre-order visits the node first.