leetcode 814. Binary Tree Pruning | 814. 二叉树剪枝（Java）
题目
https://leetcode.com/problems/binary-tree-pruning/
题解
思路很简单，看草稿：
/*** 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 TreeNode pruneTree(TreeNode root) {if (retain(root)) return root;else return null;}public boolean retain(TreeNode node) {if (node == null) return false;boolean l = retain(node.left);boolean r = retain(node.right);if (!l) node.left = null;if (!r) node.right = null;return l || r || node.val == 1;}
}
leetcode 814. Binary Tree Pruning | 814. 二叉树剪枝（Java）相关推荐
- 814. Binary Tree Pruning（C语言）
814. Binary Tree Pruning(C语言) 深度优先搜索树 + 剪枝 题目 Given the root of a binary tree, return the same tree ...
- 814. Binary Tree Pruning
题目描述: We are given the head node root of a binary tree, where additionally every node's value is eit ...
- LeetCode 257. Binary Tree Paths （二叉树路径）
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1/ ...
- leetcode103JAVA_[LeetCode] 103. Binary Tree Zigzag Level Order Traversal Java
题目: Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from lef ...
- 【二叉树的迭代版后序遍历】LeetCode 145. Binary Tree Postorder Traversal
LeetCode 145. Binary Tree Postorder Traversal Solution1:递归版答案 二叉树的后序遍历递归版是很简单的,关键是迭代版的代码既难理解又难写!但听了花 ...
- 【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版 二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
- 【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版 二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
- LeetCode: Flatten Binary Tree to Linked List
LeetCode: Flatten Binary Tree to Linked List LeetCode: Flatten Binary Tree to Linked List Given a bi ...
- LeetCode 103. Binary Tree Zigzag Level Order Traversal
LeetCode 103. Binary Tree Zigzag Level Order Traversal Solution1:基于层次遍历的微改 /*** Definition for a bin ...
最新文章
- extjs中滚动条属性_十分钟快速了解 JS 中的 offset、scroll、client
- Touch Event
- 保留索引，cdh更新schema.xml
- 腾讯2016春季实习生（技术运营岗）招聘电话面试题汇集。
- pyhton3 json.dumps 去除空格
- 微信小程序开发系列二：微信小程序的视图设计
- 【Android】Windows环境安装Android Studio教程
- M1 三合一机床电路故障检测
- 【报告分享】第七次全国人口普查主要数据情况报告.pdf（附下载链接）
- javaWeb注册，登陆，注销功能的实现
- 在无参考数据集（比如LIME、MEF、DICM）上使用NIQE指标
- 小学计算机设备维护制度,中学设备管理维护规章制度
- PHP合并两张(多张)图片
- 精算未来会被计算机代替吗,年薪过百万还不用加班？揭开精算专业的真面目（下篇）...
- ajax调用ajax_AJAX即将到来
- FastStone Capture——集截屏、滚动截图、录屏、图片编辑为一体轻量级截图软件
- Quality-Estimation1 (翻译质量评价-复现 WMT2018 阿里论文结果)
- 凯撒（caesar）密码加解密方法
- 7. Components
- 华为mate pad pro搭载鸿蒙系统,华为MatePad Pro2将全球首发预装鸿蒙OS系统