1038. Binary Search Tree to Greater Sum Tree | Recursive | Iterative | Morris Traversal

[@youtubeuserlovesyoutube2207]

thanks aryan GOAT

[@mohammedansil2302]

Thanks clear explanation

[@codebreaker6578]

I can't believe myself that i done this problem without watching this video . Because it's my first tree problem ,I just saw GFG how to traverse tree and came up with solution which passed all testcase in single run with time complexity O(N) class Solution { public: int sum=0; void update(TreeNode* node){ if(node==nullptr){ return; } update(node->right); sum+=node->val; node->val=sum; update(node->left); } TreeNode* bstToGst(TreeNode* root) { update(root); return root; } };

[@abhinay.k]

nice

[@insaneclutchesyt948]

u must be a genius

[@codebreaker6578]

@@insaneclutchesyt948 but didn't optimal approach

[@cenacr007]

❤

[@codebreaker6578]

I didn't do any tree question till now should i do this ?

[@insaneclutchesyt948]

my dumbass thought vertical order traversal to get the sum of all the right nodes

[@codebreaker6578]

can you please explain how recursive is using O(n) space , in itertative it's because of stack

[@ajayprabhu465]

Function stack space takes O(n)

[@ITACH1688]

recursive function calls are managed using call stack.

[@codebreaker6578]

@@ajayprabhu465 👍

[@codebreaker6578]

@@ITACH1688 👍

[@lokesh8660]

waiting for today's dc in place modification approach 🥲