README_EN.md

145. Binary Tree Postorder Traversal

Description

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?

Solutions

Python3

Java

...