首页 > 代码库 > Binary Tree post order traversal

Binary Tree post order traversal

One:

  Using two stacks, stack to traversal the node, stackr to record the parent node when visiting its right-child;

     https://oj.leetcode.com/problems/path-sum/

     https://oj.leetcode.com/problems/binary-tree-postorder-traversal/

Binary Tree post order traversal