中序遍历二叉树
1 非递归,使用栈
/**
* 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*> stk;
TreeNode *cur = root;
while( !stk.empty() || cur ){
if(cur){
stk.push(cur);
cur = cur->left;
}
else{
cur = stk.top();
stk.pop();
res.push_back(cur->val);
cur = cur->right;
}
}
return res;
}
};
/**
* 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;
TreeNode *cur = root;
while(cur != NULL){
if(cur->left == NULL){
res.push_back(cur->val);
cur = cur->right;
}
else{
TreeNode *temp = cur->left;
while(temp->right != NULL && temp->right != cur)
temp = temp->right;
if(temp->right == NULL){
temp->right = cur;
cur = cur->left;
}
else{
res.push_back(cur->val);
temp->right = NULL;
cur = cur->right;
}
}
}
return res;
}
};