/**
 * Problem: https://leetcode.com/problems/maximum-depth-of-binary-tree/
 * Solution: Find the Height of Binary Tree.
 * 
 * 
 * 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) {
        if(root == null) return 0;
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }
}

Create Maximum_Depth_of_Binary_Tree.java