中序遍历

利用栈实现非递归遍历，先压栈，压到空时，再弹栈，实现左中右遍历

#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <stack>

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};

// 递归
void InorderTraversalRecursion(TreeNode* root, std::vector<int>& res)
{
    if (root) {
        InorderTraversalRecursion(root->left, res);
        res.push_back(root->val);
        InorderTraversalRecursion(root->right, res);
    }
}

// 非递归
void InorderTraversal(TreeNode* root, std::vector<int>& res)
{
    std::stack<TreeNode*> s;
    while (root || !s.empty()) {
        if (root) {
            s.push(root);
            root = root->left;
        }
        else {
            root = s.top();
            s.pop();
            res.push_back(root->val);
            root = root->right;
        }
    }
}

int main()
{
    TreeNode* n1 = new TreeNode(1);
    TreeNode* n2 = new TreeNode(2);
    TreeNode* n3 = new TreeNode(3);
    TreeNode* n4 = new TreeNode(4);
    TreeNode* n5 = new TreeNode(5);
    TreeNode* n6 = new TreeNode(6);
    TreeNode* n7 = new TreeNode(7);
    n1->left = n2;
    n1->right = n5;
    n2->left = n3;
    n2->right = n4;
    n5->left = n6;
    n5->right = n7;

    std::vector<int> res;
    InorderTraversalRecursion(n1, res);
    std::copy(res.begin(), res.end(), std::ostream_iterator<int>(std::cout, " "));
    std::cout << std::endl;

    res.clear();
    InorderTraversal(n1, res);
    std::copy(res.begin(), res.end(), std::ostream_iterator<int>(std::cout, " "));
    std::cout << std::endl;
}