1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
    vector<int> ans;
    vector<int> preorderTraversal(TreeNode* root) {
        if(root != nullptr){
            ans.push_back(root->val);
            preorderTraversal(root->left);
            preorderTraversal(root->right);
        }
        
        return ans;
    }
};
cs