Can master parent be beautiful vertex?

[mayankA47 (Mayank MITTAL)]

given is a tree(or many trees); except root, every vertex has exactly 1 parent, so if the size of adjacency list is more than 2 then it is beautiful.
what is wrong in above concept?

[pratyush63 (Pratyush Kumar)]

Refer these:

Beautiful Vertices - some doubts

Can Master Parent be a beautiful Vertex?? (I have assumed it is possible when childrens of Master Parent are greater than 1) - is this right?? Can you give me a wrong test-case for my code if my above assumptions hold? Code id = https://ide.codingblocks.com/s/180331

Not able to pass the sample test case

@piyush.bansal8158625 You are doing mistake in your DFS helper function. See, according to the sample case, the graph would be like this: [11] According to your DFS helper function and by your line 27: children[node]+=dfsHelper(neighbour,visited,children); node 1 will have 4 children ie. itself, 2, 3, and 4. Note that this is a recursive function and if you call dfshelper while on node 1… line 27 would be like: children[1]+=dfshelper(2,visited,children). Now dfshelper(2,vistited,children) wou…

[pratyush63 (Pratyush Kumar)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.