46.leetcode题目：94. Binary Tree Inorder Traversal

题目：

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

For example:
Given binary tree {1,#,2,3},

   1    \     2    /   3

return [1,3,2].

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

分析：

昨天做了先序遍历。

class Solution {public:    //vector<int> temp;//递归时定义的全局变量；    vector<int> inorderTraversal(TreeNode* root) {        //Recursive solution       /* if(root!=NULL){            inorderTraversal(root->left);            temp.push_back(root->val);            inorderTraversal(root->right);        }        return temp;*/                // iteratively        vector<int> temp;stack<TreeNode*> stk;//if(root==NULL)//return temp;//stk.push(root);while(!stk.empty()||root){   while(root) {            stk.push(root);            root=root->left;        }        root=stk.top();        temp.push_back(root->val);        stk.pop();        root=root->right;}return temp;    }};

不想分析了，直接贴代码吧