#interview
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:...
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)) ·...
