/**
* 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;
if(root==NULL) return res;
stack<TreeNode*>st;
TreeNode *cur=root;
while(cur||!st.empty()){
while(cur!=NULL){
st.push(cur);
cur=cur->left;
}
if(!st.empty()){
res.push_back(st.top()->val);
cur=st.top()->right;
st.pop();
}
}
return res;
}
};