层序遍历一个二叉树。就是从左到右一层一层的去遍历二叉树。
需要借用一个辅助数据结构即队列来实现,队列先进先出,符合一层一层遍历的逻辑,而用栈先进后出适合模拟深度优先遍历也就是递归的逻辑。
在循环中
1.注意每一层的节点数,需要记录下来;
2.加入计数下,这一层节点数下的子节点。
3.当这一层全部pop后,开启下一层
/**
* 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* ptr = que.front();
que.pop();
vec.push_back(ptr->val);
if(ptr->left) que.push(ptr->left);
if(ptr->right) que.push(ptr->right);
}
res.push_back(vec);
}
return res;
}
};
#226.翻转二叉树
#递归法
递归三部曲:
- 确定递归函数的参数和返回值
TreeNode* invertTree(TreeNode* root)
- 确定终止条件
if (root == NULL) return root;
- 确定单层递归的逻辑
swap(root->left, root->right); invertTree(root->left); invertTree(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: TreeNode* invertTree(TreeNode* root) { //递归 if(root == NULL) return root; swap(root->left,root->right); invertTree(root->left); invertTree(root->right); return root; } };
#101. 对称二叉树
#递归法
class Solution {
public:
bool compare(TreeNode* left, TreeNode* right) {
if (left == NULL && right != NULL) return false;
else if (left != NULL && right == NULL) return false;
else if (left == NULL && right == NULL) return true;
else if (left->val != right->val) return false;
else return compare(left->left, right->right) && compare(left->right, right->left);
}
bool isSymmetric(TreeNode* root) {
if (root == NULL) return true;
return compare(root->left, root->right);
}
};