Ukkonen found efficient c
Ukkonen found efficient constructions for suffix-based ones of these. Prefix ones are useful in lexicographic applications. One family of them uses zig and zag operations; another imposes five rules to maintain balance. Traversing one can be done preorder, inorder, or postorder, the last of which can be used to implement a depth-first search. An important special type of these is associated with a connected graph and can be found by using Kruskal's algorithm. In the simplest form of this organizing tool, the keys of all the nodes in the left subsection are less than the one at the top, and those on the right are greater - that applies to the binary search variety of them. For 10 points, name these connected, acyclic graphs that are topped by a root node which is connected by edges to branches of nodes known as leaves.
Ukkonen found efficient constructions for suffix-based ones of these.
trees