you are given a tree having A nodes numbered from 0 to A-1 rooted at node 0 each node has a distinct value Ranging between [0,A-1],i node having value C[I].( No two nodes have same value) for each more node in the tree you have to find the smallest non-negative integer value which is not present in the subtree of that node.
Answers
Answered by
3
Answer:
refer to the attach drop some thx plz mark branilist answer
Attachments:
Answered by
1
Explanation:
go through the attachment
it's Isha malviya
Attachments:
Similar questions