FUN WITH TREES

CodeChefOpen on judge ↗

Chef has started learning trees. After finishing the theoretical concepts , he started solving exercise questions. He successfully solved all the question but got stuck in this one. Given a rooted tree with N nodes numbered from 1 – N with node 1 as root. You are also given two types of operation. Type 1 : x y val ( Add the value val to all the nodes that are coming in the from node x to node y i

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