Click here to Skip to main content
15,892,797 members
Articles / General Programming / Algorithms

Learn Postorder Binary Tree Traversal by Solving Maximum Depth of a Binary Tree

Rate me:
Please Sign up or sign in to vote.
3.00/5 (1 vote)
29 Nov 2020CPOL3 min read 3.4K   1  
How to traverse a postorder binary tree
There are many ways to traverse through a binary tree. In this post, we focus on learning how to do a postorder traversal of a binary tree.

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
United States United States
Joshua is a passionate software developer working in the Seattle area. He also has experience with developing web and mobile applications, having spent years working with them.

Joshua now finds his spare coding time spent deep in the trenches of VR, working with the newest hardware and technologies. He posts about what he learns on his personal site, where he talks mostly about Unity Development, though he also talks about other programming topic that he finds interesting.

When not working with technology, Joshua also enjoys learning about real estate investment, doing physical activities like running, tennis, and kendo, and having a blast with his buddies playing video games.

Comments and Discussions