题目描述
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
代码实现
1.递归的方法
/**
* 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> ans;
vector<int> inorderTraversal(TreeNode* root) {
//递归实现
if(root == NULL) return ans;
else{
inorderTraversal(root->left);
ans.push_back(root->val);
inorderTraversal(root->right);
}
return ans;
}
};
2.栈的方法
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ans;
//用栈实现
if(root == NULL) return ans;
stack<TreeNode*> s;
TreeNode* cur = root;
while(!s.empty() || cur != NULL){
while(cur != NULL){
s.push(cur);
cur = cur->left;
}
cur = s.top();
s.pop();
ans.push_back(cur->val);
cur = cur->right;
}
return ans;
}
};