← Amazon questions

Print K-Sum Paths in Binary Tree

Filed under Amazon

Given a binary tree and a target sum K, print all paths that sum up to K. A path can start and end anywhere in the tree, but must go downwards (parent to child).

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.