814. Binary Tree Pruning（C语言）

晴宝儿

于 2022-11-10 21:20:50 发布

阅读量225

点赞数

分类专栏：二叉树文章标签：剪枝 c语言算法数据结构 leetcode

本文链接：https://blog.csdn.net/weixin_42413356/article/details/127796648

版权

二叉树专栏收录该内容

21 篇文章 0 订阅

订阅专栏

814. Binary Tree Pruning（C语言）

深度优先搜索树 + 剪枝

题目

Given the root of a binary tree, return the same tree where every subtree (of the given tree) not containing a 1 has been removed.

A subtree of a node node is node plus every node that is a descendant of node.

Example 1:
在这里插入图片描述
Input: root = [1,null,0,0,1]
Output: [1,null,0,null,1]
Explanation:
Only the red nodes satisfy the property “every subtree not containing a 1”.
The diagram on the right represents the answer.

Example 2:
在这里插入图片描述
Input: root = [1,0,1,0,0,0,1]
Output: [1,null,1,null,1]

Example 3:
在这里插入图片描述
Input: root = [1,1,0,1,1,0,1,0]
Output: [1,1,0,1,1,null,1]

Constraints:
The number of nodes in the tree is in the range [1, 200].
Node.val is either 0 or 1.

解答

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool Tra(struct TreeNode* root)
{
    if(root == NULL)
    {
        return false;
    }

    bool left_flag = Tra(root->left);
    bool right_flag = Tra(root->right);
    if(left_flag == false)
        root->left = NULL;
    if(right_flag == false)
        root->right = NULL;
    if(left_flag == false && right_flag == false && root->val == 0)
        return false;
    else
        return true;
}
struct TreeNode* pruneTree(struct TreeNode* root){
    bool flag = Tra(root);
    if(flag == false && root->val == 0)
        root = NULL;
    return root;
}