LeetCode : Binary Tree Preorder Traversal
2014-05-21 18:01
260 查看
vector<int> preorderTraversal(TreeNode *root) {
vector<TreeNode *> vec;
vector<int > vecResult;
TreeNode *pointer=root;
while(pointer||vec.empty()){
if(pointer){
vecResult.push_back(pointer->val);
vec.push_back(pointer);
pointer=pointer->left;
}
else{
pointer=vec.back();
vec.pop_back();
pointer=pointer->right;
}
}
return vecResult;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode----Binary Tree Preorder Traversal
- LeetCode---Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode | Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode: Construct Binary Tree from Preorder and Inorder Traversal
- leetcode-105&106 Construct Binary Tree from Preorder and Inorder Traversal I&II
- leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode][Java] Binary Tree Preorder Traversal
- LEETCODE: Construct Binary Tree from Preorder and Inorder Traversal
- 【LeetCode】-Binary Tree Preorder Traversal
- 【LeetCode】-Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode][tree] Binary Tree Preorder Traversal
- LeetCode之Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- LeetCode Binary Tree Preorder Traversal
- LeetCode题解： Construct Binary Tree from Preorder and Inorder Traversal
- 【Leetcode】Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode Binary Tree Preorder Traversal
- LeetCode --- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal