iterativeWalk.java

//----------------------------------------------------
	protected void iterativeWalk(Visitor v)
	{
		Node node = root;
		
		if (node != nil) {
			while (node.left != nil) {
				node = node.left;
			}
			
			while (node != nil) {
				
				//Visit node
				v.visit(node);
				
				//If there is a right node, go right and then go to leftmost node (successor)
				if (node.right != nil) {
					node = node.right;
					while (node.left != nil) {
						node = node.left;
					}
				}
				
				//If no right node, first parent with left child as node is the new node to visit (successor)
				else {
					while (node.parent != nil && node == node.parent.right) {
						node = node.parent;
					}
					node = node.parent;
				}
			}
		}
	}
	//----------------------------------------------------