二叉树的前序遍历

题:
给定一个二叉树，返回它的前序遍历。

例:
输入: [1,null,2,3]
输出: [1,2,3]

码:

    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root){
            TreeNode *cur=NULL;
            stack<TreeNode*> sk;
            sk.push(root);
            int n=0;
            while(sk.size()){     
                cur=sk.top();
                sk.pop();
                res.push_back(cur->val);
                if(cur->right)
                    sk.push(cur->right);
                if(cur->left)
                    sk.push(cur->left);                
            }
        }
        return res;
    }

源:
https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/