Binary tree

A rooted tree in which each node has at most two children. Its structure supports recursive algorithms and efficient searching when additional ordering rules are imposed.

Tree (data structure): A hierarchical data structure made of nodes connected by parent–child links, with no cycles. A binary tree is the special case in which each node has at most two children.
Full binary tree: A binary tree in which every node has either zero or two children. This shape excludes nodes with exactly one child.
Binary heap: A complete binary tree satisfying a heap-order rule between each node and its children. It supports priority-queue operations with logarithmic-height paths.
Trie: A rooted tree that stores keys through paths labeled by their successive symbols or digits. Tries branch by key symbols, often with more than two children per node.
Binary search: A search algorithm that repeatedly halves a sorted search interval to locate a target. Balanced binary search trees echo the repeated partitioning that makes this algorithm efficient.
Rooted tree: A tree with one distinguished vertex called the root, which defines parent and child relationships. The root establishes the direction and hierarchy used in a binary tree.
Complete binary tree: A binary tree whose levels are full except possibly the last, which is filled from left to right. Completeness keeps the tree compact and enables array-based storage.
Huffman coding: A lossless compression method that assigns shorter prefix codes to more frequent symbols. Its codewords are represented by paths through a binary tree.
B-tree: A balanced search tree whose nodes can contain multiple keys and have many children. B-trees trade binary branching for shallow height in storage systems.
Asymptotic analysis: The study of how an algorithm's resource use grows with input size. Tree height often determines whether operations take logarithmic or linear time.

Linked from 8 pages