Shiyam's approach sounds like a typical radix tree implementation e.g. Radix tree based routing in networking. that's a good solution for a very big data set and where we do'nt want to store non-used data portions.
On Fri, Aug 28, 2009 at 6:42 PM, Shyam <[email protected]> wrote: > > I think we can have a BST that is keyed based on birth day date and > month this is done as follows.. If i have a birth day on Jan 2 nd then > key value is 2(2nd day of the year) if birthday is feb 14th then its 45 > (31+14).The tree nodes can have a count of number of people whose > b'days are on that day or you can have a ptr to linked list that has > names of persons who have bdays on same day from nodes in BST. > > Hope it was helpful > Cheers!! > Shiyam > > -- "Subvert the paradigm." - C.K. Prahlad --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
