代码随想录刷题第13天
二叉树的遍历顺序
- 深度优先遍历
- 前序遍历(递归法,迭代法)
- 中序遍历(递归法,迭代法)
- 后序遍历(递归法,迭代法)
- 广度优先遍历
- 层次遍历(迭代法)
二叉树的前序遍历
/*
* @lc app=leetcode.cn id=144 lang=cpp
*
* [144] 二叉树的前序遍历
*/
// @lc code=start
/**
* 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) {}
* };
*/
#include <vector>
#include <iostream>
using namespace std;
// struct TreeNode {
// int val;
// TreeNode *left;
// TreeNode *right;
// TreeNode() : val(0), left(nullptr), right(nullptr) {}
// TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
// };
class Solution {
public:
vector<int> result;
void transation(TreeNode* root, vector<int> &vec){
if (root == nullptr)
{
return ;
}
vec.push_back(root->val);
transation(root->left,vec);
transation(root->right,vec);
}
vector<int> preorderTraversal(TreeNode* root) {
transation(root,result);
return result;
}
};
// @lc code=end
二叉树的后序遍历
/*
* @lc app=leetcode.cn id=145 lang=cpp
*
* [145] 二叉树的后序遍历
*/
// @lc code=start
/**
* 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) {}
* };
*/
#include <vector>
#include <iostream>
using namespace std;
class Solution {
public:
vector<int> result;
void transation(TreeNode* root, vector<int> &vec){
if (root == nullptr)
{
return ;
}
transation(root->left,vec);
transation(root->right,vec);
vec.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
transation(root,result);
return result;
}
};
// @lc code=end
二叉树的中序遍历
/*
* @lc app=leetcode.cn id=94 lang=cpp
*
* [94] 二叉树的中序遍历
*/
// @lc code=start
/**
* 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> result;
void transation(TreeNode* root, vector<int> &vec){
if (root == nullptr)
{
return ;
}
transation(root->left,vec);
vec.push_back(root->val);
transation(root->right,vec);
}
vector<int> inorderTraversal(TreeNode* root) {
transation(root,result);
return result;
}
};
// @lc code=end
核心是改变递归的遍历顺序即可,比较基础