LeetCode 144. Binary Tree Preorder Traversal 二叉树的前序遍历 C++

Input: [1,null,2,3]
   1
         2
    /
   3

Output: [1,2,3]

 1 vector<int> preorderTraversal(TreeNode* root) {
 2         vector<int> res={};
 3         if(!root)
 4             return res;
 5         stack<TreeNode*> s;
 6         TreeNode* cur=root;
 7         while(!s.empty()||cur){
 8             while(cur){
 9                 res.push_back(cur->val);
10                 s.push(cur);
11                 cur=cur->left;
12             }
13             cur=s.top();
14             s.pop();
15             cur=cur->right;
16         }
17         return res;
18     }

 1 void preOrder(TreeNode* root,vector<int>& m){
 2         if(!root)
 3             return;
 4         m.push_back(root->val);
 5         preOrder(root->left,m);
 6         preOrder(root->right,m);
 7     }
 8     
 9     vector<int> preorderTraversal(TreeNode* root) {
10         vector<int> res={};
11         if(!root)
12             return res;
13         preOrder(root,res);
14         return res;
15     }