leetcode 94. 二叉树的中序遍历(代码实现)

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) 
    {
        stack<TreeNode*> stack_;
        TreeNode* cur =root;
        vector<int> ret;
        while(cur||!stack_.empty())
        {
            while(cur)
            {
                stack_.push(cur);
                cur = cur ->left;
            }
            TreeNode* top = stack_.top();
            ret.push_back(top->val);
            stack_.pop();

            cur = top->right;
        }

        return ret;
    }
};