力扣-94题 二叉树的中序遍历（C++）- 递归+迭代

题目链接：https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
题目如下：



思路一：递归

/**
 * 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) {}
 * };
 */
class Solution {
public:
    void inorder(vector<int>& result,TreeNode* root){//中序遍历：左根右
    //tip：
    //1、vector是一个能够存放任意类型的动态数组
    //2、push_back是在数组末尾添加元素
    //3、pop_back是在数组末尾去除元素
        if(root==NULL) return ;
        inorder(result,root->left);
        result.push_back(root->val);
        inorder(result,root->right);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;

        inorder(result,root);

        return result;
    }
};

思路二：迭代

/**
 * 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) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> stk;

        while(root||stk.size()){
            while(root){
                stk.push(root);
                root=root->left;
            }

            root=stk.top();
            stk.pop();
            result.push_back(root->val);

            root=root->right;
        }

        return result;
    } 
};