Unconditionally terminated loop

[someone235]

Hi, this looks like a bug.

	// When there is no left node walk the parents until the parent's left
	// node is not equal to the previous child.  This will be the previous
	// node.
	for iter.node.left == nil {
		parent := iter.parents.Pop()
		for parent != nil && parent.left == iter.node {
			iter.node = parent
			parent = iter.parents.Pop()
		}
		iter.node = parent
		return iter.limitIterator()
	}

I guess you want to do something like this

	// When there is no left node walk the parents until the parent's left
	// node is not equal to the previous child.  This will be the previous
	// node.
	if  iter.node.left == nil {
		for iter.node.left == nil {
			parent := iter.parents.Pop()
			for parent != nil && parent.left == iter.node {
				iter.node = parent
				parent = iter.parents.Pop()
			}
			iter.node = parent
		}
		return iter.limitIterator()
	}

Am I correct?