题目:就是给出中序遍历的非递归方式
题解:可以用上篇方法但是多了set操作,这里可以直接设置一个工作指针,让这个指针一直沿着左子树走到尽头并一直push进stack中,然后从stack取出放入ans里,然后沿着右走一步
代码:
/**
* 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> ans;
stack<TreeNode*> st;
TreeNode* cur = root;
while(cur||!st.empty()){
while(cur){
st.push(cur);
cur=cur->left;
}
cur = st.top();
st.pop();
ans.push_back(cur->val);
cur = cur->right;
}
return ans;
}
};