主要还是注意维护栈
/**
* Definition for binary tree* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int>tree;
vector<int> inorderTraversal(TreeNode *root) {
stack<TreeNode*>node;
TreeNode *pCurrent=root;
TreeNode *pNode;
while(!node.empty()||pCurrent){
if(pCurrent){
node.push(pCurrent);
pCurrent=pCurrent->left;
}
else {
pNode=node.top();
tree.push_back(pNode->val);
node.pop();
pCurrent=pNode->right;
}
}
return tree;
}
};