https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
题目描述:Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
分析:查找一个二叉树的最大深度
解题思路:求二叉树的深度.递归求解,递归到当前节点如果为叶子结点时,返回1。求解左右子树中最大的二叉树深度。
public int maxDepth(TreeNode root) {
if(root==null)return 0;
if(root.left==null&&root.right==null)return 1;
return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
}