unique-binary-search-trees-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer <code>n</code>, return all the structurally unique BST&#39;s (binary search trees), which has exactly <code>n</code> nodes of unique values from <code>1</code> to <code>n</code>. Return the answer in any order.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg" style="width: 600px; height: 148px;" />
<pre>
Input: n = 3
Output: [[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
</pre>

Example 2:

<pre>
Input: n = 1
Output: [[1]]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>

generateTrees

Unique Binary Search Trees II

Unique Binary Search Trees

unique-binary-search-trees

不同的二叉搜索树

Different Ways to Add Parentheses

different-ways-to-add-parentheses

为运算表达式设计优先级

Tree

Binary Search Tree

Dynamic Programming

Backtracking

Binary Tree

给你一个整数 <code>n</code> ，请你生成并返回所有由 <code>n</code> 个节点组成且节点值从 <code>1</code> 到 <code>n</code> 互不相同的不同 二叉搜索树 。可以按 任意顺序 返回答案。

 

<div class="original__bRMd">
<div>
示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg" style="width: 600px; height: 148px;" />
<pre>
输入：n = 3
输出：[[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
</pre>

示例 2：

<pre>
输入：n = 1
输出：[[1]]
</pre>

 

提示：

<ul>
	<li><code>1 <= n <= 8</code></li>
</ul>
</div>
</div>