public void leftView(binaryTree root){
		binaryTree [] array = new binaryTree[20];
		int i = 0,j = 0;
		binaryTree temp =  new binaryTree();
		array[j++] = root;
		array[j++] = null;
		while(i+1 != j){
			temp = array[i++];
			if(temp != null) System.out.println(temp.data);
			if(temp == null) {
				array[j++] = null;
				continue;
			}else{
				if(temp.left != null) array[j++] = temp.left;
				if(temp.right != null) array[j++] = temp.right;
			}
		}
		System.out.println("from left" + array[0].data);
		for(i =0 ; i<array.length ; i++){
			if(array[i] == null){
				if(i+1 <array.length && array[i+1] != null ) System.out.println("from left" + array[i+1].data);
			}
				
		}

	}