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
题目链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
题目大意:求二叉树最大深度
题目分析:递归即可
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxDepth(TreeNode root) {
if(root == null) {
return 0;
}
int leftMax = maxDepth(root.left) + 1;
int rightMax = maxDepth(root.right) + 1;
return Math.max(leftMax, rightMax);
}
}