I was asked this question at Microsoft.
so take the given node and check the following to detect if it is a DLL or
BTree
if (node->pointer1->pointer2 != node){
its a BTree
}else {
DLL
}
now converting to the other is a big problem in itself
Thanks,
On Mon, Aug 9, 2010 at 8:04 PM, amit <amitjaspal...@gmail.com> wrote:
> Given a pointer to the node, the node has one data part and two
> address pointers of its own type,
> If the node represent a doubly linked list convert it to B-Tree and
> vice versa.
>
> --
> 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.
