Read about B+ trees. It might help. On Sat, Nov 28, 2009 at 1:53 PM, Nayn <[email protected]> wrote:
> Hi, > > We have to find inorder traversal on a binary tree whose leaf nodes > are connected in a singly circular linked list. The tree might not be > a complete binary tree. > > Thanks > Nayn > > -- > > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > > -- Shishir Mittal Ph: +91 9936 180 121 -- 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?hl=en.
