二叉树的后序遍历（简单）

最新推荐文章于 2024-10-01 23:05:47 发布

kiki_0831

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量169

点赞数 1

分类专栏： LeetCode 文章标签：算法数据结构 java leetcode

本文链接：https://blog.csdn.net/qq_52954114/article/details/142551756

版权

LeetCode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

题目

给你一棵二叉树的根节点 root ，返回其节点值的 后序遍历 。

思路

1、递归

2、用一个栈（非递归）

3、用两个栈（非递归）

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        after(root,list);
        return list;
    }

    private void after(TreeNode node,List<Integer> list) {
        if (node == null) {
            return;
        }
        after(node.left,list);
        after(node.right,list);
        list.add(node.val);
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
		List<Integer> list = new ArrayList<>();

		if(root!= null){
			Stack<TreeNode> stack=new Stack<>();
			stack.push(root);
			while(!stack.isEmpty()){
				TreeNode head=stack.peek();
				if(head.left!=null&&root!=head.left &&root != head.right){
					stack.push(head.left);
				}else if(head.right != null&&root!= head.right){
					stack.push(head.right);
				}else{
					list.add(head.val);
					root=stack.pop();
				}
			}
		}

		return list;
	}
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        if (root != null) {
            Stack<TreeNode> stack = new Stack<>();
            Stack<TreeNode> collect = new Stack<>();
            stack.push(root);
            while (!stack.isEmpty()) {
                root = stack.pop();
                collect.push(root);
                if (root.left != null) {
                    stack.push(root.left);
                }
                if (root.right != null) {
                    stack.push(root.right);
                }
            }
            while (!collect.isEmpty()) {
                list.add(collect.pop().val);
            }
        }
        return list;
    }
}