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 {
private:
    vector<int> vc; //存储遍历数据
public:
    vector<int> inorderTraversal(TreeNode* root) {
        if(root){
            inorderTraversal(root->left);
            vc.push_back(root->val);
            inorderTraversal(root->right);
        }
        return vc;
    }
};

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;   
        inTravel(root, res);   //传递res参数保存返回值
        return res;
    }
private:
    void  inTravel(TreeNode* root,vector<int> &vc){
        if(!root)
            return;
        inTravel(root->left,vc);
        vc.push_back(root->val);
        inTravel(root->right,vc);
    }
};

方法二：迭代

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        stack<TreeNode *> st;
        vector<int> res;
        while(root || !st.empty()){
            while(root){        //遍历到最下层左子树
                st.push(root);
                root=root->left;
            }
            root=st.top();      //出栈，左子树访问完了
            st.pop();
            res.push_back(root->val);
            root=root->right;   //访问右子树，因为左子树已经访问完
        }
        return res;
    }
};