Thanks clear explanation

thanks aryan GOAT

❤

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

@abhinaykumarak01

3 күн бұрын

nice

@insaneclutchesyt948

2 күн бұрын

u must be a genius

@codebreaker6578

2 күн бұрын

@@insaneclutchesyt948 but didn't optimal approach

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

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

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

@ajayprabhu465

3 күн бұрын

Function stack space takes O(n)

@ITACH1688

3 күн бұрын

recursive function calls are managed using call stack.

@codebreaker6578

2 күн бұрын

@@ajayprabhu465 👍

@codebreaker6578

2 күн бұрын

@@ITACH1688 👍

waiting for today's dc in place modification approach 🥲