Skip to content

Glossary: Data Structures and Algorithms in Go

Binary search tree (BST)

Also written: BST, binary search trees

A binary tree where everything in a node's left subtree is smaller and everything in its right subtree is bigger. Insert and lookup take one step per level.

Where the book teaches it

Related terms

Binary treeIn-order traversalBalanced tree