Asking for help to solve a Data Structure related tree problem
Difference between en1 and en2, changed 35 character(s)
Recently I have come across a problem of an IUPC contest, where the problem asks for the summation of the mex value of all subtrees of a tree for each vertex where the vertex is the root of the tree. The detailed statement is given below or can be found in [Your text to link here...I-Mexy](https://toph.co/c/cuet-inter-university-codestorm-1-0)(I-Mexy).↵
↵
↵
Can anyone give me hints or provide any resources about this topic? 

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English babjamal 2024-12-28 11:50:54 2 Tiny change: '2b4.png)\nCan anyo' -> '2b4.png)\n\nCan anyo'
en3 English babjamal 2024-12-28 11:50:13 78
en2 English babjamal 2024-12-28 11:48:54 35
en1 English babjamal 2024-12-28 11:47:49 484 Initial revision (published)