LeetCode 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) {}
 * };
 */
// class Solution {
// public:
//     void inorder(TreeNode*root,vector<int> &res){
//         if(root==nullptr)
//             return ;
//         inorder(root->left,res);
//         res.push_back(root->val);
//         inorder(root->right,res);
//     }
//     vector<int> inorderTraversal(TreeNode* root) {
//         vector<int> res;
//         inorder(root,res);
//         return res;
//     }
// };

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==nullptr)
            return res;
        stack<TreeNode*> stk;
        TreeNode *node=root;
        while(!stk.empty()||node!=nullptr){
            while(node!=nullptr){
                stk.emplace(node);
                node=node->left;
            }
            node=stk.top();
            res.push_back(node->val);
            stk.pop();
            node=node->right;
        }
        return res;
    }
};