Binary tree

[Dmitri Makovetskiy]

   
public class BTreeEx3 {
	public static void main(String[] args) {
		BTree tree=new BTree();
		tree.add(5);
		tree.add(6);
		tree.add(1);
		tree.add(19);
		tree.add(3);
		tree.add(10);
		tree.add(2);
		
		tree.print();
	}
		
}

class BTree{
	private	Node head;
	public void add(int info){
		Node node=new Node(info);
		if(head==null){
			head=node;
			return;
		}
		
		Node current=head;
		while (true) {
			if(info<current.info){// what number is current.info. whats happening there. what number does it represent?
				if (current.left==null) {
					current.left=node;
				        return;
				}
				else
					current = current.left;
			}
			else {
				if(info>current.info){
					if (current.right==null) {
						current.right=node;
					        return;
					}
					else
						current = current.right;
				}
			}
		}
		
		
			
	}
	//toLinkedList()
	public void print(){
		print(head);
	}
	private void print(Node node){
		if(node==null)
			return;
		print(node.left);
		System.out.println(node.info);
		print(node.right);
	}
	
	class Node{
		int info;
		public Node(int info) {
			super();
			this.info = info;
		}
		Node left;
		Node right;
	}
} 

the algorithm above should give me a binary tree. i have one question. what current.info represent? what number?

[David Newton]

...

Is this code that you wrote yourself?

[Dmitri Makovetskiy]

David Newton wrote:...

Is this code that you wrote yourself?

NO, NEWTON, it is my teachers code. i understand that. but i dont understand the line which i marked

[David Newton]

Please KeepItDown.

So, follow the code: I'm still not convinced you ever work out anything on paper--this is a *critically* important skill.

1) What does BTree.add(int) do?
2) What does the Node constructor do?
3) Question answered, correct?

That's all it takes: you only had to look at a few lines of code to determine the answer.

[Dmitri Makovetskiy]

David Newton wrote:Please KeepItDown.

So, follow the code: I'm still not convinced you ever work out anything on paper--this is a *critically* important skill.

1) What does BTree.add(int) do?
2) What does the Node constructor do?
3) Question answered, correct?

That's all it takes: you only had to look at a few lines of code to determine the answer.

Newton , i scanned the whole thing. i know where the info comes from

but what value does the current.info has got?

[David Newton]

The same value it was constructed with.

[Campbell Ritchie]

David Newton wrote: . . . I'm still not convinced you ever work out anything on paper--this is a *critically* important skill. . . .

Agree with David N.

You need to imagine you have added 2 3 1 in that order to a tree, and draw a diagram of that tree after adding each of those values.