@Ankit: this particular problem can be solved with min heap implementation for tournament tree concept. But i want to code the actual tournament tree, where we can also find out the winner over all and all other contestants that lost to the winner. how to code that?
Regards Dumanshu BITS-Pilani On Jul 19, 12:45 am, ankit sambyal <ankitsamb...@gmail.com> wrote: > @Dumanshu : Implement the tournament tree as a Min Heap. Its prety > straight forward to do that. If you have any doubt, plz ask ?? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
