This node contains the real work. TreeList is just there to implement {@link java.util.List}. The nodes don't know the index of the object they are holding. They do know however their position relative to their parent node. This allows to calculate the index of a node while traversing the tree.
The Faedelung calculation stores a flag for both the left and right child to indicate if they are a child (false) or a link as in linked list (true).
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|