Maximum sum of Non-adjacent nodes in Binary Tree GeeksforGeeks Problem of the day C++ Code & Example

[@probabilitycodingisfunis1]

Time Complexity & Space Complexity: O(N)
Code:
unordered_mapm;
int getMaxSum(Node *root)
{
// Add your code here
//recursive code
//optimize -> 2 lines
//with node
//case 1
if(!root)return 0;
if(m[root])return m[root];
int withnode = root->data;
//call your grandchildren
if(root->left)
{ withnode+=getMaxSum(root->left->left);
withnode+=getMaxSum(root->left->right);
}
if(root->right)
{
withnode+=getMaxSum(root->right->left);
withnode+=getMaxSum(root->right->right);
}
//case 2
//without node
//call your children
int withoutnode = getMaxSum(root->left)+getMaxSum(root->right);
return m[root]= max(withnode,withoutnode);
}

[@anuragkhugshal4994]

Good and intuitive approach, other channels are mostly using the same textbook approach.

[@probabilitycodingisfunis1]

Glad it was helpful!

[@letscodewithshivam]

Very good explanation, recursion works like magic. Thanks

[@felixrajkumar2796]

Thank god, she explained in English ! Also her intuition to get into the solution is pretty good.

[@silajmunna2854]

At start I haven't even understood the problem but the way you explained the solution is wow...... Superb ❤️

[@probabilitycodingisfunis1]

Thank you so much 😀

[@silajmunna2854]

@@probabilitycodingisfunis1 do u have insta page ??

[@vignanreddy3252]

Damn! Can’t expect for more clear explanation.

[@TarangRastogi-l4x]

Very Nice explanation madam . Keep working hard

[@suryansh70]

this is the best explanation ever possible very well explained very easy to understand thank u

[@probabilitycodingisfunis1]

Thank you so much ❤️

[@debabratamukherjee9577]

Excellent Explanation.

[@ratishjain2718]

The way you explain intuition is brilliant !! Nice work

[@anshul7628]

Great explanation .🙂👍

[@vinamrasangal8436]

you are just amazing alisha

[@farazjawaid2982]

how the fuck can someone explain this so beautifully
great stuff maam !!

[@sarveshkanwar1300]

mann gayee awesome explanation

[@adityavaste8963]

Wonderful Explanation

[@anandverma4357]

Good approach ma'am
Very good approach

[@aqua6150]

Underrated Channel

[@gowthamshankark6779]

excellent and so easy to understand

[@dasarisaikiran7206]

nice explanation ma'am

[@probabilitycodingisfunis1]

Thank you so much

[@sidddddddoo7]

This is so good!
Thank you!

[@abhigyanraha5620]

thanks for the great explanation!

[@AmitKumar-hr3pc]

very good problem solving approach

[@probabilitycodingisfunis1]

Thank you so much

[@sharadyadav9630]

Good explain

[@felixrajkumar2796]

Keep on the good work !

[@probabilitycodingisfunis1]

Thank you so much !

[@rishupal7904]

Damn! nice explanation

[@user-gc5pr8gp9c]

Wow

[@showsshorts4696]

mam after how many months pf practice you solved this approach

[@VishalSingh-oj7go]

this was good !

[@probabilitycodingisfunis1]

Thank you so much

[@midhileshmomidi3120]

I did like level order traversal and did 1d dp kind but I got wrong ans for this test case [2,1,3,null,4]
ans is given 7 but isn't it 6
tree : 2
1 3
4

[@probabilitycodingisfunis1]

If 4 is a child of 1 and not 3 , then 4 and 3 can be taken together and the answer will be 7

[@midhileshmomidi3120]

@@probabilitycodingisfunis1 Thank you for explanation. I got it I now. I misunderstood the question, thought complete level should be skipped

[@malkeetsingh3147]

Awesome Explaination

[@loveleshbhagat1114]

unordered_mapm;
int getMaxSum(Node *root)
{
//Recursive Solution ->Optimization using unordered_map
//Base Case
if(root==NULL) return 0;
if(root->left==NULL && root->right==NULL) return root->data;
if(m.find(root)!=m.end()) return m[root];
// Case 1
int withnode = root->data;
if(root->left!=NULL){
withnode += getMaxSum(root->left->left);
withnode += getMaxSum(root->left->right);
}
if(root->right!=NULL){
withnode += getMaxSum(root->right->left);
withnode += getMaxSum(root->right->right);
}
//Case 2:
int withoutnode = getMaxSum(root->left)+getMaxSum(root->right);
m[root] = max(withnode,withoutnode);
return max(withnode,withoutnode);
}

[@probabilitycodingisfunis1]

Thank you Lovelesh for listing out the code

[@loveleshbhagat1114]

@@probabilitycodingisfunis1 The way you approach problem , its amazing

[@probabilitycodingisfunis1]

@@loveleshbhagat1114 Thank you so much! Glad you found it helpful Lovelesh 😃

[@gorakhkumargupta491]

nice explanation ma'am

[@probabilitycodingisfunis1]

Thank you so much