Add Rooted Tree Data Structure Visualization

[CS101-o]

Hi! I'm a student at the University of Manchester and noticed that csvistool has Kruskal's algorithm but is missing the rooted tree data structure that underlies it. A general rooted tree visualization would show nodes with any number of children (not just 2 like binary trees), parent-child relationships, tree terminology (root, ancestors, descendants, levels, depth), and basic operations like traversals. This would complement the existing Kruskal's implementation since Kruskal's uses a forest of rooted trees internally. As a natural extension, I could later add Union-Find/Disjoint Set operations (Find, Union with path compression). Reference: Applied Discrete Structures textbook. I'd be happy to implement this if it aligns with the project's goals!

[kathy-tran07]

Hi! Feel free to add a root tree data structure. That would be great! We already have a page for Disjoint Set, so you might want to look at that first.