clueless coding // TODO: be smarter

LeetCode Maximum Depth of Binary Tree: Java Solution



TL;DR Code Solution


public int maxDepth(TreeNode root) {

    if (root == null)
        return 0;

    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;


}