How do I solve Count Good Nodes in Binary Tree?

Question

Accepted Answer

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.