public void printAllTrees(List<Node> allTrees) {
        TreeTraversals tt = new TreeTraversals();
        System.out.println("Total number of trees " + allTrees.size());
        for(Node node : allTrees) {
            tt.inOrder(node);
            System.out.println();
            tt.preOrder(node);
            System.out.print("\n\n");
        }
    }
Date 11/07/2015
@author Tushar Roy

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
Total number of binary search tree possible is Catalan number.

https://leetcode.com/problems/unique-binary-search-trees-ii/
src/com/interview/tree/ConstructAllBinaryTreeFromInorderTraversal.java