132. Binary Tree Postorder Traversal

EasyTree

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

Examples

Input: [1,null,2,3]

Output: [3,2,1]

Explanation: Postorder: left, right, node.

Constraints

  • The number of nodes in the tree is in the range [0, 100].
  • -100 <= Node.val <= 100
Loading...

Run checks all cases above. Submit evaluates all test cases.