Leetcode 94. 二叉树的中序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> ans;
        if(!root) return ans;
        vector<TreeNode*> sta;
        sta.push_back(root);
        while(sta.back()->left) sta.push_back(sta.back()->left);
        while(!sta.empty()){
            ans.push_back(sta.back()->val);
            TreeNode* p=sta.back();sta.pop_back();
            if(p->right) {
                sta.push_back(p->right);
                while(sta.back()->left) sta.push_back(sta.back()->left);
            }
        }
        return ans;
    }
};