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.
计算二叉树的最大深度,没什么好说的,记录一下
public int maxDepth(TreeNode root) {
return maxDepthNum(root, 0);
}
public int maxDepthNum(TreeNode root, int currentDepth) {
if (root == null) {
return currentDepth;
}
currentDepth++;
return Math.max(maxDepthNum(root.left,currentDepth),maxDepthNum(root.right,currentDepth));
}