给定一个二叉树 root
,返回其最大深度。
二叉树的 最大深度 是指从根节点到最远叶子节点的最长路径上的节点数。
示例 1:
输入:root = [3,9,20,null,null,15,7] 输出:3
示例 2:
输入:root = [1,null,2] 输出:2/** * 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 { int res;
public int maxDepth(TreeNode root) { return deep(root); }
int deep(TreeNode root) { if (root == null) { return 0; } int lefth = deep(root.left); int righth = deep(root.right); return Math.max(lefth,righth)+1; } } 标签:right,TreeNode,val,int,力扣,二叉树,深度,root,left From: https://www.cnblogs.com/JavaYuYin/p/18014101