Python Algorithm – Iterative Postorder Traversal | Set 1 (Using Two Stacks) – Stack – We have discussed iterative inorder and iterative preorder traversals.
Stack
C Algorithm – Iterative Postorder Traversal | Set 1 (Using Two Stacks) – Stack – We have discussed iterative inorder and iterative preorder traversals
Java Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack) – Stack – We have discussed a simple iterative postorder traversal using two stacks
Python Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack) – Stack – We have discussed a simple iterative postorder traversal
C Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack) – Stack – We have discussed a simple iterative postorder traversal using two stacks
The Celebrity Problem – Stack – In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes
Largest Rectangular Area in a Histogram | Set 2 – Stack – Find the largest rectangular area possible in a given histogram where the largest rectangle
Expression Evaluation – Stack -Evaluate an expression represented by a String. Expression can contain parentheses, you can assume parentheses
Print ancestors of a given binary tree node without recursion – Stack – Given a Binary Tree and a key, write a function that prints all the ancestors
Python Algorithm – Length of the longest valid substring – Stack – Given a string consisting of opening and closing parenthesis