← Amazon questions

Count nodes at weighted distance k from root

Filed under Amazon

Given a binary tree where traveling to the left child costs 1 and right child costs 2, find the total number of nodes at a total distance/cost of k from the root.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.