Count Good Nodes in Binary Tree — Step-by-Step Visualization

A node X is good if on the path from root to X there are no nodes with a value greater than X. Return the number of good nodes using DFS — track the running max as you descend.

Related Problems

• Average of Levels in Binary TreeTree, DFS
• Binary Tree Right Side ViewTree, DFS
• Flatten Binary Tree to Linked ListTree, DFS
• Invert Binary TreeTree, DFS
• Kth Smallest Element in a BSTTree, DFS
• Lowest Common Ancestor of a Binary TreeTree, DFS