![]() |
|
Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Re: Tree Structure Challengeby LanX (Cardinal) |
on Nov 30, 2015 at 20:47 UTC ( #1148959=note: print w/replies, xml ) | Need Help?? |
I'm not sure if I get the problem, the naive solution is to collect all nodes from each tree with successive ->Parent calls and to construct the difference with cut operations. (like deleting hash slices) What am I missing? If the goal is to have minimal numbers of operations, we'd need to know things like if all leaves have the same distance to root.
Cheers Rolf
In Section
Meditations
|
|