Data Structures

← Back to Domain-Specific Abstractions by Domain

4 domain-specific abstractions whose origin domain is Data Structures.

• Exponential tree — A search-tree structure whose branching factors shrink doubly exponentially with depth, storing keys at leaves and auxiliary predecessor structures at internal nodes.
• Level ancestor problem — A rooted-tree query problem asking for a node’s ancestor at a specified depth after preprocessing the tree.
• Tree (abstract data type) — A hierarchical abstract data type of nodes linked by parent–child relations, with one root and a unique parent for every other node.
• Tree rotation — A local binary-tree restructuring that preserves in-order key order while changing parent-child shape.