题目:
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
AC代码:使用迭代算法
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ans;
if(root == NULL){
return ans;
}
stack<TreeNode*> saveTrees;
saveTrees.push(root);
while(!saveTrees.empty()){
if(saveTrees.top()->left && saveTrees.top()->left->val != -99999){
saveTrees.push(saveTrees.top()->left);
}
else{
ans.push_back(saveTrees.top()->val);
saveTrees.top()->val = -99999;
TreeNode* temp = saveTrees.top();
saveTrees.pop();
if(temp->right){
saveTrees.push(temp->right);
}
}
}
return ans;
}
};