用一个stack实现循环方法:
/**
* 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> inorderTraversal(TreeNode *root) {
vector<int> result;
TreeNode* pCurrent = root;
stack<TreeNode*> s;
while(!s.empty() || pCurrent != NULL)
{
if(pCurrent != NULL)
{
s.push(pCurrent);
pCurrent = pCurrent->left;
}
else
{
TreeNode* pNode = s.top();
s.pop();
result.push_back(pNode->val);
pCurrent = pNode->right;
}
}
return result;
}
};