public List<Node> generateTrees(int n) {
        if (n == 0) {
            return Collections.emptyList();
        }
        return construct(1, 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