Leetcode 1448. Count Good Nodes in Binary Tree

Count how many nodes in a binary tree are "good", meaning their value is at least the maximum value seen on the path from the root to that node. This is solved by a tree traversal (DFS/BFS) that carries the current path maximum and increments the count when a node's value >= that maximum; n up to 10^5.