Linked from

The 8 pages that link to Binary tree, each with the reason it gives.

• Mathematical inductionRelated: Induction on tree structure proves properties such as node-count bounds.

• Catalan numberRelated: Catalan numbers count ordered binary tree shapes with a fixed number of internal nodes.

• Huffman codingRelated: The binary branching structure represents the zero and one choices in Huffman codewords.

• Binary search treeNarrower topic: The search tree adds an ordering rule to this broader structure.

• Binary logarithmRelated: A balanced binary tree with n leaves has height near log₂(n).

• MagmaRelated: Parenthesized magma expressions correspond to binary trees of operation applications.

• Red–black treeNarrower topic: The red–black structure is a constrained binary tree.

• Kraft–McMillan inequalityNarrower topic: For a binary alphabet, codewords correspond to paths in a binary tree.