public int maxDepth(TreeNode root) {
        if (root == null) return 0;
        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }
Find height of both left and right subtree and return max of them plus one
src/problems/easy/MaximumDepthofBinaryTree.java