代码随想录算法训练营
今日任务
层序遍历 ,226.翻转二叉树 ,101.对称二叉树
文章目录
层序遍历
102.二叉树的层序遍历
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
//层序遍历,借助队列
List<List<Integer>> result=new ArrayList<>();
//创造一个队列
Queue<TreeNode> queue=new LinkedList<>();
//树为空,直接返回
if(root==null){
return result;
}
queue.offer(root);
while(!queue.isEmpty()){
int size = queue.size();
List<Integer> list=new ArrayList<>();
while(size>0){
TreeNode poll = queue.poll();
list.add(poll.val);
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
size--;
}
result.add(list);
}
return result;
}
}
107.二叉树的层次遍历II
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
//层序遍历,借助队列
List<List<Integer>> result=new ArrayList<>();
//创造一个队列
Queue<TreeNode> queue=new LinkedList<>();
//树为空,直接返回
if(root==null){
return result;
}
queue.offer(root);
while(!queue.isEmpty()){
int size = queue.size();
List<Integer> list=new ArrayList<>();
while(size>0){
TreeNode poll = queue.poll();
list.add(poll.val);
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
size--;
}
result.add(list);
}
Collections.reverse(result);
return result;
}
}
199. 二叉树的右视图
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result=new ArrayList<>();
if(root==null){
return result;
}
//构建一个队列
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()){
int size=queue.size();
while(size>0){
TreeNode poll = queue.poll();
size--;
if(size==0){
result.add(poll.val);
}
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
}
return result;
}
}
637.二叉树的层平均值
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Double> averageOfLevels(TreeNode root) {
List<Double> result=new ArrayList<>();
if(root==null){
return result;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
int count=size;
double sum=0;
while(size>0){
size--;
TreeNode poll = queue.poll();
sum=sum+poll.val;
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
result.add(sum/count);
}
return result;
}
}
429.N叉树的层序遍历
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> result=new ArrayList<>();
if(root==null){
return result;
}
Queue<Node> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
List<Integer> list=new ArrayList<>();
int size=queue.size();
while(size>0){
Node poll = queue.poll();
size--;
if(poll.children!=null){
List<Node> children = poll.children;
for (Node node : children) {
queue.offer(node);
}
}
list.add(poll.val);
}
result.add(list);
}
return result;
}
}
515.在每个树行中找最大值
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> result=new ArrayList<>();
if(root==null){
return result;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
int max=queue.peek().val;
while(size>0){
size--;
TreeNode poll = queue.poll();
if(poll.val>max){
max=poll.val;
}
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
result.add(max);
}
return result;
}
}
116.填充每个节点的下一个右侧节点指针
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
if(root==null){
return null;
}
Queue<Node> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
while(size>0){
size--;
Node poll = queue.poll();
if(size==0){
poll.next=null;
}else{
Node peek = queue.peek();
poll.next=peek;
}
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
}
return root;
}
}
117.填充每个节点的下一个右侧节点指针II
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
if(root==null){
return null;
}
Queue<Node> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
while(size>0){
size--;
Node poll = queue.poll();
if(size==0){
poll.next=null;
}else{
Node peek = queue.peek();
poll.next=peek;
}
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
}
return root;
}
}
104.二叉树的最大深度
//迭代法,利用层序
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
int result=0;
if(root==null){
return result;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
while(size>0){
size--;
TreeNode poll = queue.poll();
if(size==0){
result++;
}
if(poll.right!=null){
queue.offer(poll.right);
}
if(poll.left!=null){
queue.offer(poll.left);
}
}
}
return result;
}
}
//递归,利用后序
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
//递归,利用后序排序
return getDepth(root);
}
public int getDepth(TreeNode root){
if(root==null){
//叶子节点
//其实深度就是从叶子节点开始向上加的
return 0;
}
int leftDepth = getDepth(root.left);
//System.out.println(leftDepth);
int rightDepth = getDepth(root.right);
//System.out.println(rightDepth);
return 1+Math.max(leftDepth,rightDepth);
}
}
111.二叉树的最小深度
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int minDepth(TreeNode root) {
int result=0;
if(root==null){
return result;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
result++;
int flag=0;
while(!queue.isEmpty()){
int size=queue.size();
while(size>0){
size--;
TreeNode poll = queue.poll();
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
if(poll.right==null&&poll.left==null){
//叶子节点
flag=1;
break;
}
}
if(flag==0){
result++;
}else{
break;
}
}
return result;
}
}
226.翻转二叉树
//递归法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root==null){
return null;
}
swapNode(root);
invertTree(root.left);
invertTree(root.right);
return root;
}
public void swapNode(TreeNode root) {
TreeNode temp=root.left;
root.left=root.right;
root.right=temp;
}
}
//层序遍历法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
//层序遍历翻转
if(root==null){
return root;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
while(size>0){
size--;
TreeNode poll = queue.poll();
swapChild(poll);
if(poll.left!=null){
queue.offer(poll.left);
}
if(poll.right!=null){
queue.offer(poll.right);
}
}
}
return root;
}
public void swapChild(TreeNode node){
TreeNode temp=node.left;
node.left=node.right;
node.right=temp;
}
}
101.对称二叉树
//超级繁琐的写法,层序遍历+分别遍历左边和右边再翻转比较
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
if(root==null||(root.left==null&&root.right==null)){
return true;
}
Queue<TreeNode> queue1=new LinkedList<>();
Queue<TreeNode> queue2=new LinkedList<>();
if(root.left!=null&&root.right!=null){
queue1.offer(root.left);
queue2.offer(root.right);
}else{
return false;
}
boolean result=true;
while(!queue1.isEmpty()&&!queue2.isEmpty()&& result){
List<Integer> list1=new ArrayList<>();
List<Integer> list2=new ArrayList<>();
int size=queue1.size();
while(size>0){
size--;
TreeNode poll1 = queue1.poll();
TreeNode poll2 = queue2.poll();
list1.add(poll1.val);
list2.add(poll2.val);
if(poll1.left!=null||poll1.right!=null){
if(poll1.left!=null){
queue1.offer(poll1.left);
}else{
TreeNode leef=new TreeNode(-101);
queue1.offer(leef);
}
if(poll1.right!=null){
queue1.offer(poll1.right);
}else{
TreeNode leef=new TreeNode(-101);
queue1.offer(leef);
}
}
if(poll2.left!=null||poll2.right!=null){
if(poll2.left!=null){
queue2.offer(poll2.left);
}else{
TreeNode leef=new TreeNode(-101);
queue2.offer(leef);
}
if(poll2.right!=null){
queue2.offer(poll2.right);
}else{
TreeNode leef=new TreeNode(-101);
queue2.offer(leef);
}
}
}
Collections.reverse(list1);
for (int i = 0; i < list1.size(); i++) {
if(list1.get(i) != list2.get(i)){
result=false;
break;
}
}
}
return result;
}
}
//学习递归!
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
//递归法,就是要判断:
//1.左子树的左子树和右子树的右子树
//2.左子树的右子树和右子树的左子树
boolean result=true;
if(root==null||(root.left==null&&root.right==null)){
return result;
}
result=compare(root.left,root.right);
return result;
}
public boolean compare(TreeNode left,TreeNode right) {
if(left==null&&right!=null){
return false;
}
if(left!=null&&right==null){
return false;
}
if(left==null&&right==null){
return true;
}
if(left.val!= right.val){
return false;
}
boolean compareOutside=compare(left.left,right.right);
boolean compareInside=compare(left.right,right.left);
return compareOutside&&compareInside;
}
}
//用队列的迭代法,比自己的要简便很多
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
boolean result=true;
if(root==null||(root.left==null&&root.right==null)){
return result;
}
//迭代法,仍然利用队列,但是每次弹出两个,再存入1.和2.进行比较
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root.left);
queue.offer(root.right);
while(!queue.isEmpty()){
TreeNode left = queue.poll();
TreeNode right = queue.poll();
if(left==null&&right==null){
continue;
}
if((left==null&&right!=null)||(left!=null&&right==null)||(left.val!= right.val)){
result=false;
break;
}
queue.offer(left.left);
queue.offer(right.right);
queue.offer(left.right);
queue.offer(right.left);
}
return result;
}
}
相关题目推荐
100.相同的树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null){
return true;
}
if((p==null&&q!=null)||(p!=null&&q==null)||(p.val!=q.val)){
return false;
}
boolean result=compare(p,q);
return result;
}
public boolean compare(TreeNode p, TreeNode q) {
if(p!=null&&q==null){
return false;
}
if(p==null&&q!=null){
return false;
}
if(p==null&&q==null){
return true;
}
if(p.val!=q.val){
return false;
}
boolean compareLeft=compare(p.left,q.left);
boolean compareRight=compare(p.right,q.right);
return compareLeft&&compareRight;
}
}
572.另一个树的子树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSubtree(TreeNode root, TreeNode subRoot) {
if(root==null&&subRoot!=null){
return false;
}
if(root==null&&subRoot==null){
return true;
}
//定义一个队列
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
boolean result=false;
while(!queue.isEmpty()){
if(result==true){
break;
}
int size=queue.size();
while(size>0){
size--;
TreeNode node = queue.poll();
if(node.val==subRoot.val){
boolean compare = compare(node, subRoot);
if(compare){
result=compare;
break;
}
}
if(node.left!=null){
queue.offer(node.left);
}
if(node.right!=null){
queue.offer(node.right);
}
}
}
return result;
}
public boolean compare(TreeNode node,TreeNode subRoot){
if(node==null&&subRoot==null){
return true;
}
if(node==null&&subRoot!=null){
return false;
}
if(node!=null&&subRoot==null){
return false;
}
if(node.val!=subRoot.val){
return false;
}
boolean compareLeft=compare(node.left,subRoot.left);
boolean compareRight=compare(node.right,subRoot.right);
return compareLeft&&compareRight;
}
}