LeetCode 104： The maximum depth of a binary tree （java）
subject ：
answer ：
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
if(root==null)
return 0;
int left=maxDepth(root.left)+1;
int right=maxDepth(root.right)+1;
return left>right ? left : right;
}
}