题目来源:
leetcode题目,网址:2236. 判断根结点是否等于子结点之和 - 力扣(LeetCode)
解题思路:
比较大小,相等返回true,不相等返回false。
解题代码:
/**
* 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 boolean checkTree(TreeNode root) {
return root.val==root.left.val+root.right.val ? true:false;
}
}
总结:
无。