Count Good Nodes in Binary Tree
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.
# Definition for a binary tree node.
# class TreeNode:
# ...
awsbuilder.hashnode.dev1 min read