Glossary: Data Structures and Algorithms in Rust

Binary search tree (BST)

Also written: BST, binary search trees

A binary tree in which everything in a node's left subtree is smaller and everything in its right subtree is bigger. Lookups and inserts take one step per level.