链接:
题意:
判断根等于左右子节点的和
解:
简单题
实际代码:
#include<iostream>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
bool checkTree(TreeNode* root)
{
return (root->val)==(root->left->val + root->right->val);
}
int main()
{
return 0;
}
限制:
树只包含根结点、左子结点和右子结点
-100 <= Node.val <= 100