Given a Binary Tree, print the nodes of a binary tree in post-order fashion.
Video coming soon!
Subscribe for more updates
Preparing for interviews? IDeserve team is here to help.
Create your profile
Create your profile, and here is what you will get:
1: Interview practice platform.
2: Once you are ready to take the interview, IDeserve team will help you get connected to the best job opportunities.
3: Personalized mentorship from IDeserve team once your interview process has started.
Creation of profile shouldn't take more than 2 minutes.
In the post-order traversal for a given node 'n', 1. We first traverse left-subtree of 'n' by calling printPostorder(n.left) 2. Then we traverse right-subtree of 'n' by calling printPostorder(n.right) 3. And finally we visit node 'n' itself.
Please checkout the code section(printPostorder()) with visualization for illustration.
Support us by whitelisting IDeserve in your ad-blocker.