Help me understand this method

[VinceGuad]

Can someone please provide inline comments for this method? I am having trouble understanding/recognizing whats going on...

	private Node openParent() {
		Queue<Node> queue = new LinkedList<Node>();
		queue.add(root);
		Node temp;
		while (queue.peek() != null) {
			if (queue.peek().leftChild != null
					&& queue.peek().rightChild != null) {
				temp = queue.remove();
				queue.add(temp.leftChild);
				queue.add(temp.rightChild);
			} else
				return queue.peek();
		}
		return null;
	}

[Mr.Beans]

You should check out Queues and Nodes if you don't already know what they are.

private Node openParent() 
        {
            // Create a new Queue object which holds data of type Node
            Queue<Node> queue = new LinkedList<Node>(); 
            // add an object with the variable name 'root' to the Queue
            queue.add(root);
            Node temp;  // Declare a variable called 'temp' of type Node
            // while the next item in the queue is not null
            while (queue.peek() != null) {
                /*
                 * Check if the Node's data field 'leftChild' and 'rightChild'
                 * from the instance of Node that is next in the Queue are
                 * not null
                 */
                if (queue.peek().leftChild != null
                        && queue.peek().rightChild != null) {
                    // Remove an the object at the front of the Queue
                    // and reference temp to it
                    temp = queue.remove(); 
                    // ad temps field 'leftChilde' to the Queue
                    queue.add(temp.leftChild);  
                    // ad temps field 'leftChilde' to the Queue
                    queue.add(temp.rightChild);
                } else
                    // the children of the Node are null, return the Node itself
                    return queue.peek();
            }
            return null;
        }

Hope that helps,

Mr. Beans

[Fubarable]

To the original poster, cross-posting can frustrate anyone who tries to help you only to find out later that the same answer was given hours ago in a cross-posted thread. No one likes wasting their time, especially a volunteer. The polite thing to do would be to not do this, but if you feel that you absolutely must, to at least provide links in both cross-posts to each other.

[VinceGuad]

Thank you very much, I understand. Sorry for the cross post.

[VinceGuad]

I have posted in the other forum that a solution has been found. Thank you