144. Binary Tree Preorder Traversal 二叉树的前序遍历
2016-12-11 22:38
537 查看
/**
* 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> preorderTraversal(TreeNode* root) {
stack<TreeNode*> s;
vector<int> ans;
TreeNode* cur = root;
while(cur || !s.empty()){
if(cur == NULL){
cur = s.top();
s.pop();
cur = cur->right;
}else{
ans.push_back(cur->val);
s.push(cur);
cur = cur->left;
}
}
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【遍历二叉树】01二叉树的前序遍历【Binary Tree Preorder Traversal】
- LeetCode OJ：Binary Tree Preorder Traversal（前序遍历二叉树）
- LeetCode：Binary Tree Preorder Traversal(非递归方法前序遍历二叉树)
- LeetCode Binary Tree Preorder Traversal 前序遍历二叉树 递归和非递归解法
- 二叉树遍历144. Binary Tree Preorder Traversal
- LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历 | Medium
- LeetCode：105_Construct Binary Tree from Preorder and Inorder Traversal | 根据前序和中序遍历构建二叉树 | Medium
- lintcode 容易题：Binary Tree Preorder Traversal 二叉树的前序遍历
- Construct Binary Tree from Preorder and Inorder Traversal 前序和中序重建二叉树
- 【LeetCode 144_二叉树_遍历】Binary Tree Preorder Traversal
- LeetCode-105：Construct Binary Tree from Preorder and Inorder Traversal (利用先序和中序遍历构建二叉树) -- medium
- LeetCode(Construct Binary Tree from Preorder and Inorder Traversal )根据二叉树的中序遍历和后序遍历重建二叉树
- 5.1.1—二叉树的遍历—Binary Tree Preorder Traversal
- [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal 由先序和中序遍历建立二叉树
- 根据前序和中序序列重建二叉树 Construct Binary Tree from Preorder and Inorder Traversal
- 二叉树前序遍历Binary Tree Preorder Traversal (Java)
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal （用先序和中序树遍历来建立二叉树）
- 【构建二叉树】01根据前序和中序序列构造二叉树【Construct Binary Tree from Preorder and Inorder Traversal】
- leetcode--第5章--树-5.1二叉树的遍历--5.1.1 binary tree preorder traversal
- 144. Binary Tree Preorder Traversal