Binary Tree Postorder Traversal
You are given the root of a binary tree. Return the values of the tree in postorder: the whole left subtree, then the whole right subtree, then the node itself. An empty tree gives an empty list.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3]
returns [2,3,1]
2, then 3, then the root 1.
Example 2
root [1,null,2,3]
returns [3,2,1]
3 and 2 come before 1.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Trees problems
- Binary Tree Preorder TraversalBeginner
- Collect the LeavesBeginner
- Count the LeavesBeginner
- Full Binary Tree CheckBeginner
- Is It a Single ChainBeginner
- Nodes With Exactly One ChildBeginner
- Replace Values With DepthBeginner
- Search Path in a BSTBeginner