Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,
Given n = 3, your program should return all 5 unique BST's shown below.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; left = null; right = null; }
* }
*/
public class Solution {
public ArrayList<TreeNode> generateTrees(int n) {
return createTree(1, n);
}
public ArrayList<TreeNode> createTree(int lo, int hi) {
ArrayList<TreeNode> list = new ArrayList<TreeNode>();
// child is null
if (lo > hi) {
list.add(null);
return list;
}
for (int i = lo; i <= hi; i++) {
ArrayList<TreeNode> lList = createTree(lo, i-1);
ArrayList<TreeNode> rList = createTree(i+1, hi);
// add left and right child to root
for (TreeNode l : lList) {
for (TreeNode r : rList) {
TreeNode root = new TreeNode(i);
root.left =l;
root.right = r;
list.add(root);
}
}
}
return list;
}
}