94. 二叉树的中序遍历

题目：
二叉树中序

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
 //1.根不空根入栈
 //2.向左子树遍历到空指针，出栈访问，指针指向出栈的右指针，右指针不空入栈，重复2
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        stack<TreeNode*> s;
        vector<int> res(0);
        int index=0;
        if(root!=nullptr){
            s.push(root);
            TreeNode* node=root;
            while(!s.empty()){
                if(node!=nullptr && node->left!=nullptr){
                    s.push(node->left);
                    node=node->left;
                }
                else{
                    node=s.top();
                    res.push_back(node->val);
                    s.pop();
                    node=node->right;
                    if(node!=nullptr){
                        s.push(node);
                        //node=node->left;
                    }
                }
            }
            return res;
        }
        else{
            return res;
        }
    }
};