Leetcode – Binary Tree Postorder Traversal (Java)
Among preoder, inorder and postorder binary tree traversal problems, postorder traversal is the most complicated one. For example, for the following tree, the post order traversal returns {4, 6, 5, 2, 3, 1}. Java Solution 1 The key to to iterative postorder traversal is the following: The order of “Postorder” is: left child -> right … Read more