โ† Amazon questions

Remove nodes not lying on path with sum >= K

Filed under Amazon

Given the root of a binary tree and an integer K, prune the tree by removing all nodes that do not lie on any root-to-leaf path having a sum greater than or equal to K.

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.