给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
2
/
3
输出: [1,3,2]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
方法一
/**
* 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:
void recurion(TreeNode* root, vector<int>& answer){
if(root->right==nullptr&& root->left == nullptr)
{
answer.push_back(root->val);
return;
}
if(root->left != nullptr)
recurion(root->left,answer);
answer.push_back(root->val);
if(root->right != nullptr)
recurion(root->right,answer);
//return ;
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> answer;
if(root==nullptr) return answer;
recurion(root, answer);
return answer;
}
};
方法二
/**
* 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) {
stack<TreeNode*> sdk;
vector<int> answer;
//sdk.push(root);
while(!sdk.empty()||root!=nullptr){
while(root!=nullptr){
sdk.push(root);
root = root->left;
}
root = sdk.top();
sdk.pop();
answer.push_back(root->val);
root = root->right;
}
return answer;
}
};
知识点
stack 的 pop()
top()
push()