Both the reverse-delete algorithm and its inverse, Kruskal's algorithm, can be used to find one of these objects with the cut property, whose edges have a minimum total weight.
Both the reverse-delete algorithm and its inverse, Kruskal's algorithm, can be used to find one of these objects with the cut property, whose edges have a minimum total weight. These structures are undirected graphs which are also connected and acyclic. One of these structures invented by Adelson-Velskii and Landis is self-balancing, and is closely related to another type defined by alternating nodes of two (*) namesake colors, red and black. Heaps are considered a specialized binary type of this object, and internal connection points within them are known as forks. For 10 points, identify this type of data structure in which each node has one or fewer parents but many children, which may be rooted or planted.
Both the reverse-delete algorithm and its inverse, Kruskal's algorithm, can be used to find one of these objects with the cut property, whose edges have a minimum total weight.
{trees} [accept {minimum spanning tree} until {Adelson}]