#recursion
Read more stories on Hashnode
Articles with this tag
B.T Postorder Traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(2n)(2 stack)& SC: O(n)(1 stack)) ·...
B.T inorder traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(n)) ·...
B.T Preorder Traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(n)) · Question Link:...
Ninja's Training using RecursiveDP(Top-Bottom)(TC:O(3*4*n)&SC:O(4*n)+O(n)call stack)&Using Iterative DP(Bottom-Up)(TC:O(3*4*n)&SC:O(4*n) O(1)(sp.opt) ·...
Max sum of non-adjacent elements using RecursiveDP(Top-Bottom)(TC :O(n)SC :O(n+n(call stack))&IterativeDP(Bottom-up)(TC:O(n) SC:O(n)&O(1)(Sp.opt)) ·...
Frog jump using Rec DP(Top-Down Approach)(TC : O(n) & SC : O(n + n (call stack))& Itr DP( Bottom-up Approach)(TC : O(n) & SC : O(n)(O(1) in Sp.Optim)) ·...
