Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· trees Mock interview

Count Good Nodes in Binary Tree

A node is good if no node on the path from the root down to it has a value greater than its own. Given the root of a binary tree, return the number of good nodes.

Examples

in: root = [3,1,4,3,null,1,5]

out: 4

root, 4, 5, and the lower 3 are good

Constraints

1 <= number of nodes <= 10^5
-10^4 <= node value <= 10^4

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit