方法一:递归
class Solution
{
private:
vector<int> v;
public:
void preorder(TreeNode* root)
{
if (root == nullptr)
{
return;
}
v.push_back(root->val);
preorder(root->left);
preorder(root->right);
}
vector<int> preorderTraversal(TreeNode* root)
{
preorder(root);
return v;
}
};