145. Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. Example: Input:  1 \ 2 / 3 Output:  [1,null,2,3][3,2,1] Follow up: Recursive solution is trivial, could yo

>>阅读原文<<