In another type of these structures, each entry is assigned a color, either red or black.
The "dancing" type of these objects is similar to the B+ type, and is used in the Reiser filesystem. In one type of these structures, the minimal element can be found in constant time and deleted in O(log n) ("big O of log n") time, a property utilized in the heap sort algorithm. In another type of these structures, each entry is assigned a color, either red or black. The AVL type is self-balancing, and in the binary type, each node has at most two children. For 10 points, name these hierarchical data structures with root and leaf nodes, a collection of which is called a "forest."
The "dancing" type of these objects is similar to the B+ type, and is used in the Reiser filesystem.
trees [{prompt on} heaps {until it is mentioned}]