这里的关键点是维护一个栈,栈中的元素是仍未访问右节点的节点,每次我们不断地往左走的时候,就不断地压栈就可以了,模拟dfs的过程。
/**
* 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) {
TreeNode * cur;
stack<TreeNode *> sta;
cur = root;
vector<int> ret;
while(cur || !sta.empty()){
while(cur){
sta.push(cur);
cur = cur->left;
}
cur = sta.top();
ret.push_back(sta.top()->val);
sta.pop();
cur = cur->right;
}
return ret;
}
};