← Microsoft questions

Transform binary tree to store child sum in internal nodes

Filed under Microsoft

Given a binary tree, transform it such that each internal node stores the sum of all its child nodes, and each leaf node stores zero.

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.