Strip in a Tree!

CodeChefOpen on judge ↗

Chef has a complete binary tree with depth $D$ and $N = 2^{D+1}-1$ nodes (numbered $1$ through $N$). Node $1$ is the root and each edge is either white or black. The shape of the tree is as follows: ![](https://codechef_shared.s3.amazonaws.com/download/LTIME82/STRPTRE/strip%20in%20a%20tree.png) Let's number the levels of the tree $0$ through $D$ from top to bottom. Each node at an odd level

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI