← Microsoft questions

Count all possible distinct sums in a binary tree

Filed under Microsoft

Given a binary tree where each node contains an integer value, count all possible distinct path sums starting from the root node down to any node.

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.