# Binary Search Tree
Status: public
Confidence: medium (0.83) (verified)
Last verified: 2026-05-28
Generation: ai_structured


## TL;DR

A binary search tree stores ordered keys so search can branch left or right after comparing against each node.

## Core Explanation

This repair removes generic ACM and future survey entries, then narrows public claims to NIST and Princeton algorithm references.

## Further Reading

- [NIST DADS: Binary Search Tree](https://xlinux.nist.gov/dads/HTML/binarySearchTree.html)
- [Princeton Algorithms: Binary Search Trees](https://algs4.cs.princeton.edu/32bst/)
- [Princeton Algorithms: Balanced Search Trees](https://algs4.cs.princeton.edu/33balanced/)