Other types of this acyclic data structure include the red/black, a self-balancing subtype of the binary search kind, and all finite ones have exactly one root node.
The "B" type of these objects was discovered by Rudolph Bayer, and a greedy algorithm named for Djikstra generates the "minimum spanning" type of these objects. One special case of this data structure with a namesake ‘sort' algorithm, in which child keys are always smaller than parent keys, is called the [*] heap. Other types of this acyclic data structure include the red/black, a self-balancing subtype of the binary search kind, and all finite ones have exactly one root node. For 10 points, name this data structure in computer science, whose childless nodes are known as "leaves".
The "B" type of these objects was discovered by Rudolph Bayer, and a greedy algorithm named for Djikstra generates the "minimum spanning" type of these objects.
tree [MJ]