[LeetCode] 894. All Possible Full Binary Trees 所有可能的满二叉树

full binary tree is a binary tree where each node has exactly 0 or 2 children.

Return a list of all possible full binary trees with Nnodes.  Each element of the answer is the root node of one possible tree.

Each node of each tree in the answer must have node.val = 0.

You may return the final list of trees in any order.

Example 1:

Input: 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]]
Explanation:
[LeetCode] 894. All Possible Full Binary Trees 所有可能的满二叉树

Note:

  • 1 <= N <= 20



参考资料:

https://leetcode.com/problems/all-possible-full-binary-trees/



LeetCode All in One 题目讲解汇总(持续更新中...)

上一篇:数位重排


下一篇:第十六届浙江省大学生程序设计竞赛 比赛后记