给定一个二叉树,返回它的中序 遍历。
示例:
输入: [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:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
inorder(res,root);
return res;
}
void inorder(vector<int> &res,TreeNode* root){
if(root){
inorder(res,root->left);
res.push_back(root->val);
inorder(res,root->right);
}
}
};
/**
* 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> res;//结果数组不能定义在递归函数里面
vector<int> inorderTraversal(TreeNode* root) {
if(root != NULL) {
inorderTraversal(root->left);
res.push_back(root->val);
inorderTraversal(root->right);
}
return res;
}
};
迭代法:
用栈来模拟中序遍历
/**
* 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) {
vector<int> res;
stack<TreeNode*> s;
TreeNode* p = root;
while(!s.empty()||p!=NULL){//当栈s为空或p指针不空进行迭代
if(p!=NULL){//当p不空,将其压入栈,并且指针指向左孩子
s.push(p);
p = p->left;
}else{//p为空指针,将栈顶元素赋给p,并弹出栈顶元素,将p push进结果数组,然后p指针指向右孩子
p = s.top();
s.pop();
res.push_back(p->val);
p = p->right;
}
}
return res;
}
};