Colorfull Tree

CodeChefOpen on judge ↗

Rohit is busy making his project and learning implementation of tree data structure for his project. He learnt a concept of making run-time changes in any given tree. Now he wants to design an application that makes the live changes in any given rooted tree. The application must perform the following task: If he provides the application with a rooted tree with $n$ nodes and the nodes are numbered

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