Optimization of one of these structures occurs only every few operations in the Day–Stout–Warren algorithm. A variety of these structures are optimized by performing rotate and flip (20[1])operations (20[2])upon inserting new values. (0[1])Balance factors of elements of these structures equal the difference of descendants’ (*) heights. One (10[1])type of these structures (10[1])can “self-balance” (10[2])in order (10[3])to (10[1])improve (10[2])runtime (10[2])by imposing rules (10[2])on different colored nodes (10[1])in their (10[2])“red–black” (10[1])variety. (10[3]0[1])For a weighted undirected complete graph, Prim’s algorithm constructs a “minimum spanning” one (10[1])of these structures. (0[1])Degeneration to a singly linked list is the worst case for the “binary search” type (10[1]0[1])of these data structures. (0[1])For 10 points, name these data structures with roots. (10[2])■END■ (10[6]0[1])