What will be the fastest way to call all the members

Question

A table stores the data for all the members of an exotic resort. Members are identified by these numbers 1,5,30,70,80,20,15,100,40,25,7,3,8,33,22. All members are to be invited in a meeting to review the membership policies. What will be the fastest way to call all the members? Write algorithm to justify your answer.

Answer 1

delegates the work to the Binary or Trinary telephone tree chain...

administrator calls two members.. ---> 2 calls made; he then sits back and waits

those two members call two members each --> 4 calls made

those four members call two members each.. --> 8 calls made

assuming the integrity of the message is not corrupted and compromised, the task

gets done in three levels, with only 7-8 people (half) making the calls

Here's the balanced binary tree, starting with the administrator at the top node:

admin

7 33

3 15 25 70

1 5 8 20 22 30 40 80

yes, someone needs to call #100, probably #80

left child is LESS than the parent node; right child is GREATER