The member function readCommittees() in the case study uses two trees, committeeTree and memberTree, to generate adjacency lists and then initialize the array vertices. However, one tree would be sufficient. What do you think is the reason for using two trees, not one?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.