Module cd0145_binary_tree_postorder_traversal

Binary Tree Postorder Traversalleetcode: binary_tree_postorder_traversal

Given a binary tree, return the postorder traversal of its nodes’ values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [3,2,1]

Follow up: Recursive solution is trivial, could you do it iteratively?

Structs

TreeNode

Functions

postorder_traversal

Solutions