← Amazon questions

Minimum iterations to pass information in an N-ary tree

Filed under Amazon

In an N-ary tree, information starts at the root. In one iteration, an informed node can pass information to at most one child. Find the minimum iterations to inform all nodes.

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.