An algorithm that uses the union-find data structure to merge these objects in increasing order of edge weights is known as Kruskal's algorithm and, like Prim's Algorithm, finds the (*) minimum weight one of these that spans a set of vertices.
The absolute value of any cofactor of a graph's Laplacian matrix is equal to the number of a certain type of this object. That theorem is a generalization of Cayley's theorem, which says there are n to the n minus two of these objects on n vertices. An algorithm that uses the union-find data structure to merge these objects in increasing order of edge weights is known as Kruskal's algorithm and, like Prim's Algorithm, finds the (*) minimum weight one of these that spans a set of vertices. Syntax analysis in a compiler involves the parser building one of these structures. The red-black and AVL variations of this data structure are both self balancing binary search examples of these structures. For 10 points, name this data structure in which each node can have a number of children and childless nodes are called leaves.
The absolute value of any cofactor of a graph's Laplacian matrix is equal to the number of a certain type of this object.
tree [accept minimum spanning tree or spanning tree early, accept specific types]