Overview
A binary tree is a structure defined on a finite set of nodes that either
- contains no nodes, or
- is composed of three disjoint sets of nodes: a root node, a left subtree, and a right subtree.
The binary tree is a specialization of the k-ary tree.
Bibliography
- “Binary Tree,” in Wikipedia, March 13, 2024, https://en.wikipedia.org/w/index.php?title=Binary_tree&oldid=1213529508#Types_of_binary_trees.
- Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).