maxDepth = function(root) {
    const isBaseCase = root === null;
    if (isBaseCase) return 0;

    return dfs(root);
}
https://leetcode.com/problems/maximum-depth-of-binary-tree/
Time O(N) | Space O(N)
@param {TreeNode} root
@return {number}