Binary Tree Preorder Traversal
2015-03-16 21:11
267 查看
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
/*
求二叉树的前序遍历序列
递归解法，下次写下迭代的
*/
class Solution {
public:
vector<int> res;
void dfs(TreeNode *root){
if(!root) return;
res.push_back(root->val);
dfs(root->left);
dfs(root->right);
}
vector<int> preorderTraversal(TreeNode *root) {
dfs(root);
return res;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 144 Binary Tree Preorder Traversal（二叉树前序遍历）
- [leetcode] Binary Tree Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- leetcode JAVA Construct Binary Tree from Preorder and Inorder Traversal 难度系数3 3.37
- Construct Binary Tree from Preorder and Inorder Traversal
- [leet code] Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode 105 Construct Binary Tree from Preorder and Inorder Traversal
- Binary Tree Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- leetcode——105——Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode（105） Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal -- leetcode
- leetcode-Binary Tree Preorder Traversal
- [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode-- Binary Tree Preorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal