Easy_3_104_Maximum Depth of Binary Tree.java

public class Solution {
    public int maxDepth(TreeNode root) {
		return (root==null)?0:Math.max(maxDepth(root.left),maxDepth(root.right))+1;
    }
}