二叉树非递归中序遍历。
用一个栈存储父节点即可。每次push右节点的时候要循环push右键点的左节点,这样pop出就可以直接访问了。
/**
* 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> res;
stack<TreeNode *> s;
TreeNode *tmp = root;
while(tmp){
s.push(tmp);
tmp = tmp->left;
}
while(!s.empty()){
tmp = s.top();
s.pop();
res.push_back(tmp->val);
if(tmp->right){
TreeNode *node = tmp->right;
while(node){
s.push(node);
node = node->left;
}
}
}
return res;
}
};