BinaryTreeNode.java

package com.coding.basic;

public class BinaryTreeNode {
	
	private Object data;
	private BinaryTreeNode left;
	private BinaryTreeNode right;
	private BinaryTreeNode root;
	
	public BinaryTreeNode(Object o){
		this.data = o;
		this.left = null;
		this.right  = null;
	}
	public Object getData() {	
		return data;
	}
	public void setData(Object data) {
		this.data = data;
	}
	public BinaryTreeNode getLeft() {
		return left;
	}
	public void setLeft(BinaryTreeNode left) {
		this.left = left;
	}
	public BinaryTreeNode getRight() {
		return right;
	}
	public void setRight(BinaryTreeNode right) {
		this.right = right;
	}
	
	public BinaryTreeNode insert(BinaryTreeNode root, Object o){
		BinaryTreeNode current = root;
		BinaryTreeNode node = new BinaryTreeNode(o);
		if(current == null)
		{
			current = node;
		}
		else if(((Integer)current.getData()).intValue() < ((Integer)o).intValue())
		{
			insert(current.getLeft(),o);
		}
		else if(((Integer)current.getData()).intValue() >= ((Integer)o).intValue())
		{
			insert(current.getRight(),o);
		}
		
		return  node;
	}

}