← Microsoft questions

Minimum length path from root to leaf with sum S in BST

Filed under Microsoft

Find the minimum length path from the root to any leaf in a Binary Search Tree (BST) that sums to a target value S.

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 Microsoft questions

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