public void addNode(T value){
		switch(value.compareTo(data)){
			case -1:{
				if(left==null){
					left = new BinaryTreeNode(value,null,null);
				} else {
					left.addNode(value);
				}
				break;
			}
			case 0:{
				if(left==null){
					left = new BinaryTreeNode(value,null,null);
				}else if(right==null){
					right = new BinaryTreeNode(value,null,null);
				} else {
					BinaryTreeNode prevLeft = left;
					left = new BinaryTreeNode(value,prevLeft,null);
				}
				break;
			}
			case 1:{
				if(right==null){
					right = new BinaryTreeNode(value,null,null);
				} else {
					right.addNode(value);
				}
				break;
			}
		}
	}