首页 > itarticle > leetcode 145. binary tree postorder traversal

leetcode 145. binary tree postorder traversal

admin 11月 13, 2020 0

145. Binary Tree Postorder Traversal

Difficulty:: Hard

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?

Solution

Language: Java


 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class  {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        traverse(root, result);
        return result;
    }
    
    // 递归版本
    private void traverse(TreeNode root, List<Integer> result) {
        if (root == null) {
            return;
        }
        traverse(root.left, result);
        traverse(root.right, result);
        result.add(root.val);
    }
    
    // 非递归版本，和Preorder差不多，不过先右后左，最后翻转
    private void traverseIterative(TreeNode root, List<Integer> result) {
        if (root == null) {
            return;
        }
        Deque<TreeNode> s = new ArrayDeque<>();
        TreeNode cur = root;
        while (!s.isEmpty() || cur != null) {
            if (cur != null) {
                result.add(cur.val);
                s.push(cur);
                cur = cur.right;
            } else {
                cur = s.pop();
                cur = cur.left;
            }
        }
        Collections.reverse(result);
    }
}