leetcode 145. Binary Tree Postorder Traversal

原创 2016年05月30日 23:22:04

题目内容
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?

题目分析
二叉树的后续遍历

/**
 * 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) {
    Stack<TreeNode> stack = new Stack<>();
    stack.push(root);
    List<Integer> ans = new ArrayList<>();
    while (!stack.isEmpty()) {
        TreeNode node = stack.pop();
        if (node != null) {
            ans.add(node.val);
            stack.push(node.left);
            stack.push(node.right);
        }
    }
    Collections.reverse(ans);
    return ans;
} 
}

相关文章推荐

Binary Tree Postorder Traversal - LeetCode 145

题目描述: Given a binary tree, return the postorder traversal of its nodes' values. For example: Gi...
  • bu_min
  • bu_min
  • 2015年05月22日 23:01
  • 191

Binary Tree Postorder Traversal leetcode145

Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given binary...

[leetcode] 145. Binary Tree Postorder Traversal 解题报告

题目链接:https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return th...

LeetCode145 Binary Tree Postorder Traversal(迭代实现) Java

题目: Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given bi...

LeetCode 145 Binary Tree Postorder Traversal

二叉树中序遍历
  • fumier
  • fumier
  • 2015年03月24日 09:25
  • 316

LeetCode 145: Binary Tree Postorder Traversal(二叉树的后序遍历,迭代法)

leetcode 145. Binary Tree Postorder Traversal     Total Accepted: 96378 Total Submissions: 271797...

leetcode(145):Binary Tree Postorder Traversal

题目Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’...

leetcode-145-Binary Tree Postorder Traversal

#include #include #include using namespace std; //Definition for a binary tree node. struct TreeN...

Leetcode 145. Binary Tree Postorder Traversal

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

[leetcode] 145.Binary Tree Postorder Traversal

题目: Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given bi...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 145. Binary Tree Postorder Traversal
举报原因:
原因补充:

(最多只允许输入30个字)