LeetCode 94. 【迭代】二叉树的中序遍历
原题链接
简单
作者:
大明湖的鱼
,
2021-01-14 17:04:19
,
所有人可见
,
阅读 329
思路
- 将左链压栈,此时栈顶为最左下节点
- 糊涂
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> res;
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
auto p = root;
while(p){
st.push(p);
p = p->left;
}
while(!st.empty()){
auto node = st.top();
st.pop();
res.emplace_back(node->val);
p = node->right;
while(p){
st.push(p);
p = p->left;
}
}
return res;
}
};
后序遍历,迭代实现
二叉树的前序遍历,迭代实现