145. Binary Tree Postorder Traversal

原创 2016年05月30日 10:05:55

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:
	vector<int> postorderTraversal(TreeNode* root) {
		struct TreeNodeFlag{
			TreeNode* node;
			bool flag;
			TreeNodeFlag(TreeNode* x) :node(x), flag(false){}
		};
		vector<int> res;
		stack<TreeNodeFlag *> mystack;
		TreeNodeFlag* p = new TreeNodeFlag(root);
		if (p->node){
			mystack.push(p);
			while (p->node->left){
				p = new TreeNodeFlag(p->node->left);
				mystack.push(p);
			}
			while (p->node->right){
				p->flag = true;
				p = new TreeNodeFlag(p->node->right);
				mystack.push(p);
				while (p->node->left){
					p = new TreeNodeFlag(p->node->left);
					mystack.push(p);
				}
			}
		}
		
		while (!mystack.empty()){
			TreeNodeFlag* t = mystack.top();
			if (t->flag == true || t->node->right == NULL){
				res.push_back(t->node->val);
				mystack.pop();
			}
			else{
				while (t->node->right){
					t->flag = true;
					t = new TreeNodeFlag(t->node->right);
					mystack.push(t);
					while (t->node->left){
						t = new TreeNodeFlag(t->node->left);
						mystack.push(t);
					}
				}
			}
		}
		return res;
	}
};








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

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

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

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’...

145.Binary Tree Postorder Traversal

题目链接:binary-tree-postorder-traversal import java.util.ArrayList; import java.util.List; import ...
  • ever223
  • ever223
  • 2015年03月19日 10:24
  • 354

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...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:145. Binary Tree Postorder Traversal
举报原因:
原因补充:

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