Exercise: Binary Tree Post-order III
OriginalAbout 5654 words
Prerequisite Knowledge
Before reading this article, you should first learn:
Writing code in postorder traversal is the most elegant. It can access the parent node (via function parameters) and the subtree (by collecting return values from recursion). Some challenging problems may require using both of these features simultaneously.