MaximumDepthBinaryTree
MaximumDepthBinaryTree.java 源码
package algorithm.recursion;
import java.util.LinkedList;
import java.util.Queue;
/**
* @author roseduan
* @time 2020/9/23 8:34 下午
* @description 二叉树的最大深度
*/
public class MaximumDepthBinaryTree {
/**
* 递归
*/
public int maxDepth(TreeNode root) {
if (root == null) {
return 0;
}
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}
/**
* 按层次遍历获取高度
*/
public int maxDepth2(TreeNode root) {
if (root == null) {
return 0;
}
int level = 0;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()) {
int n = queue.size();
for (int i = 0; i < n; i++) {
TreeNode node = queue.poll();
if (node.left != null) {
queue.add(node.left);
}
if (node.right != null) {
queue.add(node.right);
}
}
level++;
}
return level;
}
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
8、 golang
-
9、 openharmony
-
10、 Vue中input框自动聚焦