102.二叉树的层序遍历
题目链接:102.二叉树的层序遍历
文档链接:102.二叉树的层序遍历
视频链接:讲透二叉树的层序遍历 | 广度优先搜索 | LeetCode:102.二叉树的层序遍历
C++实现
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> que;
vector<vector<int>> result;
if(root != NULL) que.push(root);
while(!que.empty()){
int size = que.size();
vector<int> vec;
while(size--){
TreeNode* cur = que.front();
que.pop();
if(cur->left) que.push(cur->left);
if(cur->right) que.push(cur->right);
vec.push_back(cur->val);
}
result.push_back(vec);
}
return result;
}
};
226.翻转二叉树
题目链接:226.翻转二叉树
文档链接:226.翻转二叉树
视频链接:听说一位巨佬面Google被拒了,因为没写出翻转二叉树 | LeetCode:226.翻转二叉树
C++实现
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. 对称二叉树
题目链接:101. 对称二叉树
文档链接:101. 对称二叉树
视频链接:新学期要从学习二叉树开始! | LeetCode:101. 对称二叉树
C++实现
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;
bool outside = compare(left->left, right->right);
bool inside = compare(left->right, right->left);
bool result = outside&&inside;
return result;
}
bool isSymmetric(TreeNode* root) {
if(root == NULL)return true;
return compare(root->left, root->right);
}
};