Binary Tree Postorder Traversal

最新推荐文章于 2022-07-19 11:52:33 发布

iteye_6755

最新推荐文章于 2022-07-19 11:52:33 发布

阅读量66

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种实现二叉树后序遍历的方法，使用栈来辅助递归过程，通过一个示例展示了如何从根节点开始遍历到每个节点，并返回节点的值。

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

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

For example:
Given binary tree {1,#,2,3},

return [3,2,1].

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