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.
Asked at 2 companies
MicrosoftSalesforce
Hints
1.Think about what data structure fits Count Good Nodes In Binary Tree
2.Consider the brute force complexity and how to optimize