README.md

Problem

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

For example:

Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return [3,2,1].

use a stack and a prev pointer

solution at leetcode forum is over-complicated