Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in the binary tree.
https://leetcode.com/problems/count-good-nodes-in-binary-tree/