LeetCode 102.二叉树的层序遍历
题目链接:102.二叉树的层序遍历
踩坑:先看的视频,没踩什么坑
思路:核心是使用队列并记录每一行的size,在遍历本行的时候下一行就入队了。
代码:
/**
* 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) {
queue<TreeNode*> q;
vector<vector<int>> result;
int size;
if(root != nullptr) q.push(root);
while(!q.empty())
{
size = q.size();
vector<int> v;
while(size--)
{
TreeNode* t = q.front(); q.pop();
v.push_back(t->val);
if(t->left != nullptr) q.push(t->left);
if(t->right != nullptr) q.push(t->right);
}
result.push_back(v);
}
return result;
}
};
变体:
LeetCode 226.翻转二叉树
题目链接:226.翻转二叉树
踩坑:一个有返回值的函数可以没有变量来接收其返回值
思路:
- 递归(深度优先):使用前序遍历或后序遍历对遍历到的元素交换左右子树。中序遍历不行,因为中序遍历在处理完之后还要遍历右子树,但此时右子树已经被换成了原先的左子树。
- 层序(广度优先):对遍历到的所有节点交换左右子树。
代码:
// 递归
/**
* 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) {
queue<TreeNode*> q;
if(root != nullptr) q.push(root);
while(!q.empty())
{
int size = q.size();
while(size--)
{
TreeNode* t = q.front(); q.pop();
swap(t->left, t->right);
if(t->left != nullptr) q.push(t->left);
if(t->right != nullptr) q.push(t->right);
}
}
return root;
}
};
// 层序
/**
* 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) {
queue<TreeNode*> q;
if(root != nullptr) q.push(root);
while(!q.empty())
{
int size = q.size();
while(size--)
{
TreeNode* t = q.front(); q.pop();
swap(t->left, t->right);
if(t->left != nullptr) q.push(t->left);
if(t->right != nullptr) q.push(t->right);
}
}
return root;
}
};
LeetCode 101.对称二叉树
题目链接:101.对称二叉树
踩坑:先看的视频,没踩什么坑。
思路:对称就是根节点的左子树与右子树可以相互翻转。因此需要将一棵树分成两棵来考虑。对比两颗数的外侧与内侧,若当前两棵树的两个节点的值相等,则向下递归(这里注意内外侧),如果内外侧也相等那这两棵树才真的相等。
代码:
/**
* 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:
bool cmp(TreeNode* left, TreeNode* right)
{
if(left != nullptr && right == nullptr) return false;
else if(left == nullptr && right != nullptr) return false;
else if(left == nullptr && right == nullptr) return true;
else if(left->val != right->val) return false;
bool outside = cmp(left->left, right->right);
bool inside = cmp(left->right, right->left);
return outside && inside;
}
bool isSymmetric(TreeNode* root) {
return cmp(root->left, root->right);
}
};