Hi, On Sat, Nov 28, 2009 at 1:53 PM, Nayn <nayanish.hi...@gmail.com> 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. > > I don't think the presence of the linked list would change how inorder traversal is done. The presence of the linked list is to facilitate easy retrieval of consecutive blocks in the file system (in the context of B+ tree), if I remember correctly. Regards Aditya Shankar 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 algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
