Binary Tree Postorder Traversal 二叉树后续遍历@LeetCode

最新推荐文章于 2024-01-17 15:02:48 发布

原创最新推荐文章于 2024-01-17 15:02:48 发布 · 1.8k 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

153 篇文章

订阅专栏

LeetCode专栏

148 篇文章

订阅专栏

本文介绍了一种实现二叉树后序遍历的方法，包括递归和迭代两种方式。递归方法直接通过调用自身来实现遍历，而迭代方法则利用两个栈结构来避免递归操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

迭代解法在那篇面试总结二中写了

package Level3;

import java.util.ArrayList;

import Utility.TreeNode;

/**
 * Binary Tree Postorder Traversal
 * 
 *  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].

Note: Recursive solution is trivial, could you do it iteratively?
 *
 */
public class S134 {

	public static void main(String[] args) {

	}
	
	public ArrayList<Integer> postorderTraversal(TreeNode root) {
		ArrayList<Integer> ret = new ArrayList<Integer>();
		
		if(root == null){
			return ret;
		}
		
		rec(root, ret);
		return ret;
    }
	
	public void rec(TreeNode root, ArrayList<Integer> ret){
		if(root == null){
			return;
		}
		rec(root.left, ret);
		rec(root.right, ret);
		ret.add(root.val);
	}

}

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        ArrayList<Integer> ret = new ArrayList<Integer>();
        if(root == null){
            return ret;
        }
        Stack<TreeNode> s1 = new Stack<TreeNode>();
        Stack<TreeNode> s2 = new Stack<TreeNode>();
        s1.push(root);
        while(!s1.isEmpty()){
            TreeNode cur = s1.pop();
            s2.push(cur);
            if(cur.left != null){
                s1.push(cur.left);
            }
            if(cur.right != null){
                s1.push(cur.right);
            }
        }
        while(!s2.isEmpty()){
            ret.add(s2.pop().val);
        }
        return ret;
    }
}