solution/2200-2299/2236.Root Equals Sum of Children/Solution.cpp at main

main

leetcode-chez

397 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2200-2299\2236.Root Equals Sum of Children\Solution.cpp

1 Complexity
1 Complexity / M
0 Duplication
1 Churn
17 Lines
6 Lines of Code
1 Methods
6 LOC / Method

/**
 * 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;
    }
};