Root to leaf path sum in BST
Filed under Infoedge
The question
Given a Binary Search Tree, find whether it contains a root-to-leaf path with a sum equal to 'k'.
No write-up yet. Related questions below have one.
Related Infoedge questions
Collected from public candidate posts and coding forums. Updated Nov 2026.