二叉树的中序遍历

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

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

码:

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

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