144.二叉树的前序遍历
题目链接: 144.二叉树的前序遍历
思路: 前序遍历的顺序是根左右,依次向下先访问根再左子树,最后访问右子树。
递归总结: 每次次递归一定要有顺序,且一定要有返回值。
迭代写法:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> stk;//用栈来模拟递归
while(root || stk.size()){
while(root){
res.push_back(root->val);//访问根节点
stk.push(root);
root = root->left;//访问根节点的左子树
}
root = stk.top()->right;//访问根节点的右子树
stk.pop();
}
return res;
}
};
递归写法:
class Solution {
public:
void traversal(TreeNode* root, vector<int>&res){
if(root == NULL) return;
auto temp = root->val;
res.push_back(temp);
traversal(root->left, res);
traversal(root->right,res);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
traversal(root, res);
return res;
}
};
145.二叉树的后序遍历
题目链接: 145.二叉树的后序遍历
迭代写法:
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> stk;
while(root || stk.size()){
while(root){
res.push_back(root->val);
stk.push(root);
root = root->right;//刚好与前序遍历相反
}
root = stk.top()->left;
stk.pop();
}
reverse(res.begin(), res.end());//最后将答案反转即可
return res;
}
};
递归写法:
class Solution {
public:
void htravel(TreeNode* root, vector<int>& res){
if(!root) return;
htravel(root->left, res);
htravel(root->right, res);
res.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
htravel(root, res);
return res;
}
};
94.二叉树的中序遍历
题目链接: 94.二叉树的中序遍历
迭代写法:
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> stk;
while(root || stk.size()){
while(root){
stk.push(root);
root = root->left;
}
res.push_back(stk.top()->val);
root = stk.top()->right;
stk.pop();
}
return res;
}
};
递归写法:
class Solution {
vector<int> res;
public:
void midtraver(TreeNode* root){
if(!root) return;
midtraver(root->left);
res.push_back(root->val);
midtraver(root->right);
}
vector<int> inorderTraversal(TreeNode* root) {
midtraver(root);
return res;
}
};