题目:二叉树的先序遍历
分析:用递归超级容易
答案:
递归:
/**
* 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 {
private: vector<int> res;
public:
vector<int> preorderTraversal(TreeNode* root) {
dfs(root);
return res;
}
void dfs(TreeNode* root){
if (root!=NULL){
res.push_back(root->val);
dfs(root->left);
dfs(root->right);
}
return;
}
};