leetcode-145-Binary Tree Postorder Traversal

原创 2015年07月07日 20:14:13

                             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?

后序遍历一棵树。



递归
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public: 
    void houxu(TreeNode* root,vector<int>& s )
    {
        if(!root) return;
        houxu(root->left,s);
        houxu(root->right,s);
        s.push_back(root->val);
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>s;
        houxu(root,s);
        return s;
    }
};


非递归。
若一个节点 ,左右节点都为空,则输出。否则,分别将右节点和左节点压入栈中。
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public: 
/*
    void houxu(TreeNode* root,vector<int>& s ) // 递归
    {
        if(!root) return;
        houxu(root->left,s);
        houxu(root->right,s);
        s.push_back(root->val);
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>s;
        houxu(root,s);
        return s;
    }
*/
    vector<int> postorderTraversal(TreeNode* root) // 非递归
    {
        TreeNode* cur;
        vector<int>v;
        if(root==NULL) return v;
        
        stack<TreeNode*>s;
        s.push(root);
        
        while(!s.empty()){
            cur=s.top();
            if(!cur->left&&!cur->right){
                v.push_back(cur->val);
                s.pop();
            }
            else{
                if(cur->right){
                    s.push(cur->right);
                    cur->right=NULL;
                }
                if(cur->left){
                    s.push(cur->left);
                    cur->left=NULL;
                }
            }
        }
        return v;
    }
};




 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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
  • 318

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个字)