All Possible Full Binary Trees

最新推荐文章于 2022-05-11 17:19:17 发布

flyatcmu

最新推荐文章于 2022-05-11 17:19:17 发布

阅读量154

点赞数

分类专栏： Divided & Conquer

本文链接：https://blog.csdn.net/u013325815/article/details/106614892

版权

Divided & Conquer 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

本文探讨了全二叉树的生成算法，介绍了一种通过递归方式构建所有可能的全二叉树的方法。当节点数量为N时，返回包含所有可能的全二叉树的列表，每棵树的节点值均为0。示例展示了输入7时的输出结果，并解释了算法思路，强调了节点数量的增长规律。

摘要由CSDN通过智能技术生成

A 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 N nodes. 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:

Note:

1 <= N <= 20

思路：这题跟 Unique Binary Search Tree II很像；都是divide and conquer，代码都很类似，这题跟那个题不同的是，这题因为是两边要么为0，要么为2，那么左边的node，和右边的node，总数都是奇数，都是以2为增长的。要么1，3，5.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<TreeNode> allPossibleFBT(int N) {
        List<TreeNode> list = new ArrayList<TreeNode>();
        if(N == 1) {
            list.add(new TreeNode(0));
            return list;
        }
        N--;
        for(int i = 1; i < N; i += 2) {
            List<TreeNode> leftlist = allPossibleFBT(i);
            List<TreeNode> rightlist = allPossibleFBT(N - i);
            
            for(TreeNode left: leftlist) {
                for(TreeNode right: rightlist) {
                    TreeNode node = new TreeNode(0);
                    node.left = left;
                    node.right = right;
                    list.add(node);
                }
            }
        }
        return list;
    }
}