@all i m thinking of BST whose node structure is (year,month,date) a node n1< node n2 if (year1 < year2) or (if year1==year2 && month1 <month2) or (if year1==year2 && month1 =month2 && date 1 < date2) like partial order set ...
we can have AVL tree / threaded binary three (to get successor / predessor ) at constant tym.. comment plz.. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
