public static void main(String args[]){
        ConstructFullTreeFromPreOrderPostOrder cft = new ConstructFullTreeFromPreOrderPostOrder();
        int preorder[] = {1,2,3,6,7,8,9};
        int postorder[] = {2,6,8,9,7,3,1};
        Node root = cft.constructTree(preorder, postorder);
        TreeTraversals tt = new TreeTraversals();
        tt.inOrder(root);
        tt.preOrder(root);
        tt.postOrder(root);
    }
http://www.geeksforgeeks.org/full-and-complete-binary-tree-from-given-preorder-and-postorder-traversals/
Full tree is a tree with all nodes with either 0 or 2 child. Never has 1 child.
Test cases
Empty tree
Tree with big on left side
Tree with big on right side
src/com/interview/tree/ConstructFullTreeFromPreOrderPostOrder.java