Kruskal's and Prim's algorithms can compute one of these structures that (*) connects all vertices of a graph with minimum edge weights.
These data structures can have "zig-zig" or "zag-zag" shapes before the splaying operation is performed. Collision detections in two-dimensional space can be optimized with the "quad" variety of these data structures. Elements of these structures can be visited in preorder or postorder. Kruskal's and Prim's algorithms can compute one of these structures that (*) connects all vertices of a graph with minimum edge weights. The red-black type of these structures is a self-balancing version of their "binary search" variety. For 10 points, name this type of data structure that has a "root" node and children known as "leaves."
These data structures can have "zig-zig" or "zag-zag" shapes before the splaying operation is performed.
trees [accept any specific varieties like splay trees; prompt on “graphs”] &lt;JB Computer Science&gt;