Skip to content

Glossary: Data Structures and Algorithms

Binary search tree (BST)

Also written: BST, binary search trees

A binary tree where, at every node, smaller values go in the left subtree and bigger values in the right. This lets insert and lookup throw away a whole subtree at each step.

Where the book teaches it

Related terms

Binary treeIn-order traversalBalanced tree