把從1到n的全部狀況構成的二叉搜索樹添加到隊列中

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.java For example, Given n = 3, your program should return all 5 unique BST's shown below.遞歸 1 3

>>阅读原文<<