Suppose you are organizing a company party. The corporation has hierarchical ran

Question

Suppose you are organizing a company party. The corporation has hierarchical ranking structure, that is, the CEO is the root node of the hierarchy tree, and the CEO's immediate subordinates are the children of the root node, and so on in this fashion. To keep the party fun for all involved, you will not invite any employee whose immediate superior is invited. We want to invite as many employees as possible for headcount purposes. Give a greedy algorithm for this problem, analyze its running time, and prove it is correct.

Explanation / Answer

Though I know the homework is due tomorrow bt it's still not gd just to ask it on chegg @-@

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.