← Questions

Fewest node additions and removals to make a binary tree perfect

0
SnowflakeCodingLast asked Oct 2026

A perfect binary tree is one where every node has zero or two children and all leaves sit at the same depth. The screen opens with a warm-up, "is this tree perfect?", then asks the real question: what is the smallest number of single-node…

Sign in to unlock this question

The full prompt, the worked answer and your own canvas or code with the AI tutor. New accounts get 3 credits: each one unlocks a question for good.

Your code and the AI tutor open when you unlock this question.