94. 二叉树的中序遍历

题目描述

给定一个二叉树，返回它的中序 遍历。

 

示例

输入: [1,null,2,3]
   1
    \
     2
    /
   3

输出: [1,3,2]

 

思路1

递归。

代码

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

 

思路2

迭代。

 

代码

/**
 * 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 {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        stack<TreeNode*> tree;
        while(root || !tree.empty()){
            while (root){
                tree.push(root);
                root = root->left;
            }
            
            if (!tree.empty()){
                TreeNode* top = tree.top();
                res.push_back(top->val);
                tree.pop();
                if (top->right)
                    root = top->right;
            }
        }
        return res;
    }
};