all-possible-full-binary-trees

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer <code>n</code>, return a list of all possible full binary trees with <code>n</code> nodes. Each node of each tree in the answer must have <code>Node.val == 0</code>.

Each element of the answer is the root node of one possible tree. You may return the final list of trees in any order.

A full binary tree is a binary tree where each node has exactly <code>0</code> or <code>2</code> children.

&nbsp;
Example 1:
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/08/22/fivetrees.png" style="width: 700px; height: 400px;" />
<pre>
Input: n = 7
Output: [[0,0,0,null,null,0,0,null,null,0,0],[0,0,0,null,null,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,null,null,null,null,0,0],[0,0,0,0,0,null,null,0,0]]
</pre>

Example 2:

<pre>
Input: n = 3
Output: [[0,0,0]]
</pre>

&nbsp;
Constraints:

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

&#31532; 99 &#22330;&#21608;&#36187;

weekly-contest-99

allPossibleFBT

&#39640;&#32423;&#19987;&#23478;

All Possible Full Binary Trees

Tree

Recursion

Memoization

Dynamic Programming

Binary Tree

&#32473;&#20320;&#19968;&#20010;&#25972;&#25968; <code>n</code> &#65292;&#35831;&#20320;&#25214;&#20986;&#25152;&#26377;&#21487;&#33021;&#21547; <code>n</code> &#20010;&#33410;&#28857;&#30340; &#30495;&#20108;&#21449;&#26641; &#65292;&#24182;&#20197;&#21015;&#34920;&#24418;&#24335;&#36820;&#22238;&#12290;&#31572;&#26696;&#20013;&#27599;&#26869;&#26641;&#30340;&#27599;&#20010;&#33410;&#28857;&#37117;&#24517;&#39035;&#31526;&#21512; <code>Node.val == 0</code> &#12290;

&#31572;&#26696;&#30340;&#27599;&#20010;&#20803;&#32032;&#37117;&#26159;&#19968;&#26869;&#30495;&#20108;&#21449;&#26641;&#30340;&#26681;&#33410;&#28857;&#12290;&#20320;&#21487;&#20197;&#25353; &#20219;&#24847;&#39034;&#24207; &#36820;&#22238;&#26368;&#32456;&#30340;&#30495;&#20108;&#21449;&#26641;&#21015;&#34920;&#12290;

&#30495;&#20108;&#21449;&#26641; &#26159;&#19968;&#31867;&#20108;&#21449;&#26641;&#65292;&#26641;&#20013;&#27599;&#20010;&#33410;&#28857;&#24688;&#22909;&#26377; <code>0</code> &#25110; <code>2</code> &#20010;&#23376;&#33410;&#28857;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/08/22/fivetrees.png" style="width: 700px; height: 400px;" />
<pre>
&#36755;&#20837;&#65306;n = 7
&#36755;&#20986;&#65306;[[0,0,0,null,null,0,0,null,null,0,0],[0,0,0,null,null,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,null,null,null,null,0,0],[0,0,0,0,0,null,null,0,0]]
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;n = 3
&#36755;&#20986;&#65306;[[0,0,0]]
</pre>

&nbsp;

&#25552;&#31034;&#65306;

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

Sunbelt Computer Software

PL/B Language Development and Support