SortedArrayToTree.java

public class Arra2Tree {
	public class Node {
		int data;
		Node left;
		Node right;
		public Node(int data) {
			this.data = data;
		}

		public void setData(int data) {
			this.data = data;
		}

		public int getData() {
			return this.data;
		}

		public Node getLeft() {
			return left;
		}

		public void setLeft(Node left) {
			this.left = left;
		}

		public Node getRight() {
			return right;
		}

		public void setRight(Node right) {
			this.right = right;
		}
	}

	public static void main(String[] args) {
		//		int[] input = new int[]{5,9,2,3,5,0,7,6,8,1}; // -2,0,1,2,3,5,6,7,8,9
		int[] input = new int[]{1,2,3,4,5,6}; // -2,0,1,2,3,5,6,7,8,9
		Arrays.sort(input);
		Arra2Tree obj = new Arra2Tree();
		Node x = obj.createTree(input, 0, input.length-1);
		System.out.println(" Root  "+x.data);
		obj.inOrder(x);
	}
	
	public Node createTree(int[] input, int start, int end) {
		if(start > end) 
			return null;
		
		int mid = (start+end)/2;
		Node child = new Node(input[mid]);
		child.left = createTree(input,start,mid-1);
		child.right = createTree(input,mid+1,end);
		return child;
	}

	public void inOrder(Node root) {
		if( root == null)
			return;
		inOrder(root.left);
		System.out.println(root.data);
		inOrder(root.right);
	}
}