View difference between Paste ID: rVQMSvfL and TQbya6hp

 import java.io.*;
 import java.util.*;
 
 public class BinaryTreeTraversal {
 
     /**
      * @param args
      */
     public static void main(String[] args) {
-        // TODO Auto-generated method stub
+
-        new BinaryNode<Character>('x');
+
         int m = (int) Math.pow(2,n)-1;
         BinaryNode<Character>[] array = new BinaryNode<Character>[m];
 
         for (Character c : input.nextLine().toCharArray()) {
             array[i] = new BinaryNode<Character>(Character.isLetter(c) ? c : null);
-        //assigns to null
+
         BinaryNode<Character> root = array[0];
 
         // HERE: turn the flat, unrelated array of BinaryNode's into a real tree starting with root.
 
-        System.out.println(n);
+        System.out.println(root.toStringPreOrder());
         System.out.println(root.toStringInOrder());
         System.out.println(root.toStringPostOrder());
         // done!
     }
 }