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
Read about B+ trees. It might help.
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.
Thanks
Nayn
--
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