Minimum number of hospitals to be built on a tree such that it is available on every node or on the consecutive node

1

minimum number of hospitals to be built on a tree such that it is available on every node or on the consecutive node

2

Can you elaborate more on the problem?

I don’t know if I am thinking it the right way, but it sounds like finding the Minimum Vertex Cover of the tree.

1 Like
3

I know this from a coding challenge by Innovaccer.