public static void printAsTree(List<Integer> array, int i){
		/*Checks if the tree isnt empty*/
		if(array.isEmpty() != true){
			/*Checks if there is a right node*/
			if(i*2+1 <= array.size()){
				printAsTree(array, i*2+1);
			}
			
			int s = i;
			int level = (int)Math.ceil(Math.log(s+1)/Math.log(2));
			
			/*Prints out required spaces*/
			for(int x = 0; x<(level*4); x++){
				System.out.print(" ");
			}
			System.out.println(array.get(i-1));
			
			if(i*2 <= array.size()){
				printAsTree(array, i*2);
			}
		}
	}