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

Example :

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

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

后根遍历一颗树。

递归的实现方法，见代码。