[LintCode] Maximum Depth of Binary Tree
|
1 2 3 4 5 6 |
public int maxDepth(TreeNode root) { // write your code here if(root == null) return 0; return Math.max(maxDepth(root.left), maxDepth(root.right))+1; } |
Leave A Comment