编程日志5.6

串的习题

1.2236. 判断根结点是否等于子结点之和 - 力扣（LeetCode）

/**

 * Definition for a binary tree node.

 * 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) {}

 * };

 */

class Solution {

public:

    bool checkTree(TreeNode* root) {

        return root->val == root->left->val + root->right->val;

        //根节点的值为root->val

        //左子节点的值为root->left->val

        //右子节点的值为root->