package leetcode.maximum_depth_of_binary_tree;

import common.TreeNode;

public class Solution {
	public int maxDepth(TreeNode root) {
		if(root == null) return 0;
		int left = maxDepth(root.left);
		int right = maxDepth(root.right);
		if(left > right) return left + 1;
		else return right + 1;
	}
}

Add java solution for 104. Maximum Depth of Binary Tree
Add java solution for 104. Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree: https://leetcode.com/problems/maximum-depth-of-binary-tree/