Moving the data is unnecessary if in case the whole pointer shifting is meant for the entire node and not for individual elements of the node. temp ->next = ( temp -> next ) -> next
the above statement is more than enough to remove the midlle node from the list... -- 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.
