Disjoint sets forest - Print

[std10093]

Hello everybody,

i want to add the method print to the data structure of the disjoint sets (forest implementation) i have .Nodes can be printed in any order.Disjoint-set_data_structure
I am able to add one attribute to every node, without - of course - effect the time the other operations take to execute(MAKE_SET = Θ(1),UNION=Ο(logn),FIND_SET=O(logn))
I am not asking for code of course ,but for some pseudocode or some ideas ,because i am stuck :/

[std10093]

i came up with an idea at last if someone is interested ,he/she can pm me