goodNodes = function(root, ) {
    const isBaseCase = root === null;
    if (isBaseCase) return 0
    
    return bfs([[ root, -Infinity ]]);
}
https://leetcode.com/problems/count-good-nodes-in-binary-tree/
Time O(N) | Space O(W)
@param {TreeNode} root
@return {number}