Postorder Traversal of Binary Tree Using One Stack | Iterative Postorder Traversal of Binary Tree

In this video, I have discussed iterative Postorder traversal using one stack.
In postorder traversal, left subtree is visited first, then the right subtree and later the root.

00:00 Introduction
00:04 Postorder traversal (Recap)
00:35 Postorder traversal 1 Stack Pseudo code
05:00 C++ Implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For other tree tutorials, please refer to the below links:

For in-depth Graph theory and implementation details, please refer to the below playlist:

#DataStructure,#Trees,#FitCoder,#Algorithm,#competitiveprogramming,#binarytree