public Node constructTree(int preorder[],int postorder[]){
    
        return constructTree(preorder, postorder, 0, postorder.length-2, 0);
        
    }
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