LeetCode94：二叉树的中序遍历

https://leetcode.com/problems/binary-tree-inorder-traversal/submissions/

问题描述

Given a binary tree, return the inorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

解题思路

递归

/**
 * 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;
        recursively_helpler(root, res);
        return res;
    }

private:
    void recursively_helpler(TreeNode* pNode, vector<int>& res)
    {
        if(pNode == nullptr)
            return;
        if(pNode->left != nullptr)
            recursively_helpler(pNode->left, res);
        res.push_back(pNode->val);
        if(pNode->right != nullptr)
            recursively_helpler(pNode->right, res);
    }
};

非递归

/**
 * 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;
        inorderTraversal_impl(root, res);
        return res;
    }

private:
    void inorderTraversal_impl(TreeNode* pNode, vector<int>& res)
    {
        if(pNode == nullptr)
            return;
        stack<TreeNode*> sk;
        TreeNode* pCur = const_cast<TreeNode*>(pNode);
        while((pCur!= nullptr) || (!sk.empty()))
        {
            while(pCur!= nullptr)
            {
                sk.push(pCur);
                pCur = pCur->left;
            }

            pCur = sk.top();
            res.push_back(pCur->val);
            sk.pop();
            pCur = pCur->right;
        }        
    }
};