814-Binary Tree Pruning

kevin聪

于 2018-04-08 22:15:20 发布

阅读量780

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79859042

算法与数据结构同时被 2 个专栏收录

569 篇文章

订阅专栏

leetcode

557 篇文章

订阅专栏

本文介绍了一种针对特定二叉树（节点值仅为0或1）的剪枝算法，通过后序遍历的方式去除所有不含1值节点的子树。此算法能够有效地简化二叉树结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description:
We are given the head node root of a binary tree, where additionally every node’s value is either a 0 or a 1.

Return the same tree where every subtree (of the given tree) not containing a 1 has been removed.

(Recall that the subtree of a node X is X, plus every node that is a descendant of X.)

这里写图片描述

Note:

The binary tree will have at most 100 nodes
The value of each node will only be 0 or 1.

问题描述:
给定二叉树的头节点root，这个二叉树的每个节点值为0或者1.
现在要对该二叉树剪枝，对节点剪枝的条件为该节点的所有子树都为0

问题分析:
后续遍历即可。

解法(post-order):

class Solution {
    public TreeNode pruneTree(TreeNode root) {
        if(root == null)    return null;

        root.left = pruneTree(root.left);
        root.right = pruneTree(root.right);

        if(root.left == null && root.right == null && root.val == 0)    root = null;

        return root;
    }
}