学习目标:
- 104.二叉树的最大深度 559.n叉树的最大深度
- 111.二叉树的最小深度
- 222.完全二叉树的节点个数
学习内容:
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) {
return getDepth(root);
}
private int getDepth(TreeNode node){
if(node == null){
return 0;
}
int leftDepth = getDepth(node.left);
int rightDepth = getDepth(node.right);
if(leftDepth>rightDepth){
return leftDepth+1;
}
else{
return rightDepth+1;
}
}
}
559.n叉树的最大深度
给定一个 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 int maxDepth(Node root) {
if(root == null){
return 0;
}
int depth = 0;
if(root.children != null){
for(Node node:root.children){
depth = Math.max(depth, maxDepth(node));
}
}
return depth+1;
}
}
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) {
return getMin(root);
}
private int getMin(TreeNode node){
if(node == null){
return 0;
}
int leftDepth = getMin(node.left);
int rightDepth = getMin(node.right);
if(node.left == null && node.right != null){
return rightDepth+1;
}
if(node.left != null && node.right == null){
return leftDepth+1;
}
int depth = Math.min(leftDepth, rightDepth);
return depth+1;
}
}
222.完全二叉树的节点个数
给出一个完全二叉树,求出该树的节点个数。
/**
* 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;
}
TreeNode left = root.left;
TreeNode right = root.right;
int leftnum = 0;
int rightnum = 0;
while(left != null){
left = left.left;
leftnum++;
}
while(right != null){
right = right.right;
rightnum++;
}
if(leftnum == rightnum){
return (2<<leftnum) - 1;
}
return countNodes(root.left)+countNodes(root.right)+1;
}
}