Red-black and splay are binary self-balancing varieties of this data structure.
The B variety of this structure forms the backbone of NTFS and btrfs [butter-eff-ess]. Red-black and splay are binary self-balancing varieties of this data structure. Kruskal's and Prim's algorithms find a minimum-spanning one of these structures. An example of this where all(*) children are smaller than their parent is called a heap. They consist of nodes that point to exactly one other node. For 10 points, name this class of undirected, acyclic, connected graphs that also name a data structure with a root, branches, and leaves.
The B variety of this structure forms the backbone of NTFS and btrfs [butter-eff-ess].
{tree}