LeetCode: Binary Tree Postorder Traversal
2014-07-04 15:26
169 查看
思路：非递归先序遍历二叉树算法，每次压栈时需要访问当前节点。
code:
code:
class Solution {
public:
vector<int> preorderTraversal(TreeNode *root) {
vector<int> ret;
if(root != NULL){
stack<TreeNode *> s;
TreeNode * p = root;
s.push(p);
ret.push_back(p->val);
while(!s.empty()){
while(p->left != NULL){
p = p->left;
ret.push_back(p->val);
s.push(p);
}
TreeNode * temp = s.top();
s.pop();
if(temp->right != NULL){
p = temp -> right;
ret.push_back(p->val);
s.push(p);
}
}
}
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode:Binary Tree Postorder Traversal
- functionclass[LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
- Leetcode-106. Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode刷题（C++）——Construct Binary Tree from Inorder and Postorder Traversal（Normal）
- 【leetcode】Binary Tree Postorder Traversal
- Leetcode - Tree - 106. Construct Binary Tree from Inorder and Postorder Traversal（根据中序遍历和后序遍历重构二叉树）
- LeetCode_Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode-106.Construct Binary Tree from Inorder and Postorder Traversal
- leetcode之Binary Tree Postorder Traversal
- LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal （用中序和后序树遍历来建立二叉树）
- LeetCode OJ Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode 7 Binary Tree Postorder Traversal
- [LeetCode]*106.Construct Binary Tree from Inorder and Postorder Traversal
- 【LeetCode】Construct Binary Tree from Inorder and Postorder Traversal
- 【LEETCODE】106-Construct Binary Tree from Inorder and Postorder Traversal
- Leetcode 之Binary Tree Postorder Traversal（44）
- Leetcode Binary Tree Postorder Traversal
- LeetCode-Binary Tree Postorder Traversal
- [leetcode]Binary Tree Postorder Traversal @ Python
- LeetCode 145:Binary Tree Postorder Traversal