/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* };
*/
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型vector
*/
vector<int> preorderTraversal(TreeNode* root) {
// write code here
vector<int> res;
if(!root)
return res;
travl(root, res);
return res;
}
void travl(TreeNode *root, vector<int>& res) {
if(!root)
return;
res.emplace_back(root->val);
travl(root->left, res);
travl(root->right, res);
}
};
菜是原罪?