二叉树的遍历
前序、中序、后续遍历
前序:根->左->右
/**
* 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;
preorder(res, root);
return res;
}
void preorder(vector<int>& res, TreeNode* root){
if(!root) return;
res.emplace_back(root->val);
preorder(res, root->left);
preorder(res, root->right);
}
};
中序:左->根->右
/**
* 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> inorderTraversal(TreeNode* root) {
vector<int> res;
inorder(res, root);
return res;
}
void inorder(vector<int>& res, TreeNode* root){
if(!root) return;
inorder(res, root->left);
res.emplace_back(root->val);
inorder(res, root->right);
}
};
后序:左->右->根
/**
* 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> postorderTraversal(TreeNode* root) {
vector<int> res;
posorder(res,root);
return res;
}
void posorder(vector<int>&res,TreeNode*root)
{
if(!root)return ;
posorder(res,root->left);
posorder(res,root->right);
res.emplace_back(root->val);
}
};
层序遍历
层序遍历就是逐层遍历树结构。
广度优先搜索是一种广泛运用在树或图这类数据结构中,遍历或搜索的算法。 该算法从一个根节点开始,首先访问节点本身。 然后遍历它的相邻节点,其次遍历它的二级邻节点、三级邻节点,以此类推。
当我们在树中进行广度优先搜索时,我们访问的节点的顺序是按照层序遍历顺序的。
(队列做辅助)
- 首先根元素入队
- 当队列不为空时
- 求当前队列长度
- 依次从队列中取元素进行拓展,然后进入下一次迭代
vector<vector> levelOrder(TreeNode* root)
层序遍历返回vector<vector>,即vector的每个元素是每一层的节点
/**
* 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<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
queue <TreeNode*>que;
if(root!=NULL)
que.push(root);
while(!que.empty())
{
vector<int>vec;
int size=que.size();//该层节点个数
for(int i=0;i<size;i++)
{
TreeNode*node=que.front();
que.pop();
vec.push_back(node->val);
if(node->left)que.push(node->left);
if(node->right)que.push(node->right);
}
res.push_back(vec);
}
return res;
}
};