search

bonfy / algorithm-in-5-minutes

Algorithm in 5 minutes
0 stars 0 forks source link

10. Unique Binary Search Trees II #10

Open bonfy opened 5 years ago

bonfy commented 5 years ago

Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.

Example:

Input: 3
Output:
[
  [1,null,3,2],
  [3,2,null,1],
  [3,1,null,null,2],
  [2,1,3],
  [1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST's shown below:

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

Leetcode: 95. Unique Binary Search Trees II - https://leetcode.com/problems/unique-binary-search-trees-ii/