题目要求
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.
代码实现
/**
* 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) {
TreeNode current = root;
int rc,lc;
if(current == null)
return 0;
lc = maxDepth(root.left) + 1;
rc = maxDepth(root.right) + 1;
return lc>rc?lc:rc;
}
}
