DEV Community

Thivyaa Mohan
Thivyaa Mohan

Posted on • Edited on

4 3

Sum Tree

This post discusses the solution of the problem -

We need to solve this problem using Children Sum Property, which means sum of left and right child should be equal to its root. A tree with single node, is also considered to be following children sum property.A empty tree is also considered to be following Children Sum Property.

Below is the solution of the problem.

class Solution
{
    public:

    int findSum(Node*root){
        if(!root) return 0;
        return root->data +findSum(root->left)+findSum(root->right);
    }
    bool isSumTree(Node* root)
    {
         // Your code here
         if(!root) return true;
         if(!root->left && !root->right) return true;

         if(findSum(root->left)+findSum(root->right) == root->data)
         return (isSumTree(root->left) && isSumTree(root->right));
         else return false;
    }
};
Enter fullscreen mode Exit fullscreen mode

Sentry image

See why 4M developers consider Sentry, “not bad.”

Fixing code doesn’t have to be the worst part of your day. Learn how Sentry can help.

Learn more

Top comments (0)

A Workflow Copilot. Tailored to You.

Pieces.app image

Our desktop app, with its intelligent copilot, streamlines coding by generating snippets, extracting code from screenshots, and accelerating problem-solving.

Read the docs

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay