94. Binary Tree Inorder Traversal

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

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,3,2].

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

思路：中序遍历二叉树

代码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> result;
        if(!root){return result;}
        stack<TreeNode*> store;
        store.push(root);
        TreeNode* node;
        node = store.top();
        while(!store.empty()){
            while(node){
                if(node->left){store.push(node->left);}
                node=node->left;
            }
            node = store.top();
            result.push_back(node->val);
            store.pop();
            node=node->right;
            if(node){store.push(node);}
        }
        return result;
    }
};

代码2：