Hi, I'm trying to implement an algorithm to set the position of Nodes in
This thing works with, an linked-liste datastrukture.
My problem ist that i want the parents to move when the childs of two
different parents cross each other .
How can I do this ?
The main problem ist that this thing should be implemented in Java, that
means performance does play a role, and i can't run this
algorithm as often as it maybe need's to, especially because the tree
could get rather larg !
For any hint's and tips I'll be greatfull.