InterviewBit Problems
Postorder Traversal : Solved
About the Postorder Traversal : Solved category
(1)
Easy solution c++ recursive
(3)
Using only 1 stack no recursion no reverse
(1)
Easy solution using two stacks
(1)
JAVA using stack simple solution with much less conditions
(1)
Most easiest and intuitive way/Stack/Hint : pair<node*,visit status>
(2)
A C++ solution without reversing the output, or modifying the tree
(2)
C++ PostOrder Single Stack
(1)
Comment +1 if you like my solution
(4)
Easy Python Solution stack and reverse
(1)
Stack and reverse
(2)
Using reverse , c++ 10 line solution
(1)
Awesome approach for all three by Rachit Jain
(1)
Python Solution using stacks
(1)
Title of your comment python3
(1)
Easy C++ single stack iterative solution
(1)
Approach using 2 stacks
(1)
About the Java editorial solution: can somebody explain to me this condition...?
(1)
Alternative iterative postorder solution
(1)
Iterative Solution - C#
(1)
Simplest Solution using recursion
(1)
Recursive Solution(Postorder)
(1)
Postorder solved
(1)
next page →