leetcode 814. Binary Tree Pruning（python）

王大丫丫

于 2024-07-18 16:07:51 发布

阅读量208

点赞数 6

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode 剪枝 python

本文链接：https://blog.csdn.net/wang7075202/article/details/140525811

描述

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:

最低0.47元/天解锁文章

200万优质内容无限畅学