Returns the next Node
on the stack and pushes all of its children onto the stack, allowing us to walk the node tree without the use of recursion. If there are no more nodes on the stack then null is returned.
Node
on the stack or null if thereisn't a next node.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|