Problem 35 of 75

Count Good Nodes in Binary Tree

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

A node X in a binary tree is "good" if on the path from the root to X there are no nodes with a value greater than X. Return the number of good nodes.

[3,1,4,3,null,1,5] → 4 [3,3,null,4,2] → 3

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Count Good Nodes in Binary Tree, explainedGreg Hogg