A node is good if no node on the path from the root down to it has a value greater than its own. Given the root of a binary tree, return the number of good nodes.