Write an algorithm “Insert At Mid Point” in doubly link list.
Algorithm: Insert (node head, value) 1. [Start] 2. [Check condition] If head=null OR head->next=null then Show “cannot be inserted.” Else Node ptr=head 2.1 [Repeat loop] While ptr<>null Count++ Ptr=ptr->next [End …
Read More