95. Unique Binary Search Trees II

标签：size   wan   logs   store   possible   int   ble   tree   gen   

Problem statement:

Given an integer 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

Solutions: 

Contrast with 96. Unique Binary Search Trees, this problem wants all possible solutions. Obviously, it is DFS.

95. Unique Binary Search Trees II

标签：size   wan   logs   store   possible   int   ble   tree   gen   

原文地址：http://www.cnblogs.com/wdw828/p/6851434.html