BST in a Binary tree is a repeated question. Two things you have to find: -> Check from every node to down whether the subtree is binary or not. -> Once done check the no. of nodes in the subtree.
-> Finally keep track of the max you have got so far. On Wed, Aug 31, 2011 at 7:04 AM, Reynald <reynaldsus...@gmail.com> wrote: > Question: > Given: A singly linked list and a number 'n'. > Write a program, that will reverse consecutive 'n' nodes in the linked > list. > Optimize for space and time. > > Example: > Input: > Linked list: A->B->C->D->E->F > number 'n': 3 > > Output: > C->B->A->F->E->D > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- ___________________________________________________________________________________________________________ Please do not print this e-mail until urgent requirement. Go Green!! Save Papers <=> Save Trees -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
