重点:递归法
104. 二叉树的最大深度
题目链接:104. 二叉树的最大深度
文档讲解:代码随想录(programmercarl.com)
视频讲解:二叉树的高度和深度有啥区别?究竟用什么遍历顺序?很多录友搞不懂 | LeetCode:104.二叉树的最大深度_哔哩哔哩_bilibili
状态:已解决
Java代码:
/**
* 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 n=0;
if(root==null){
return 0;
}
if(root.left!=null){
n=Math.max(n,maxDepth(root.left));
}
if(root.right!=null){
n=Math.max(n,maxDepth(root.right));
}
return n+1;
}
}
111.二叉树的最小深度
题目链接:111.二叉树的最小深度
文档讲解:代码随想录(programmercarl.com)
视频讲解:
状态:已解决
Java代码:
/**
* 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 l=0;
if(root==null){
return 0;
}
if(root.left==null&&root.right==null){
return 1;
}
if(root.left==null){
l=minDepth(root.right)+1;
}
if(root.right==null){
l=minDepth(root.left)+1;
}
if(root.left!=null&&root.right!=null){
l=Math.min(minDepth(root.left),minDepth(root.right))+1;
}
return l;
}
}
222.完全二叉树的节点个数
题目链接:222.完全二叉树的节点个数
文档讲解:代码随想录(programmercarl.com)
视频讲解:要理解普通二叉树和完全二叉树的区别! | LeetCode:222.完全二叉树节点的数量_哔哩哔哩_bilibili
状态:已解决
Java代码:
/**
* 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 countNodes(TreeNode root) {
if(root==null){
return 0;
}
int c=0;
c=countNodes(root.left)+countNodes(root.right)+1;
return c;
}
}