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

Algorithm: Delete (node head) 1. [Start] 2. [Check for empty] If head=null then Show “List is empty” Else if head->next=null then Node ptr=head Delete ptr Head=null Else Node ptr=head 2.1[Repeat …

Read More

Algorithm: Insert (node head, value) 1. [Start] 2. Node temp Temp->data=value 3. [Check condition] If head=null then Head=temp Else if head->next=null then Head->next=temp Temp->pre=head Else Node ptr=head 3.1[Repeat loop] While …

Read More

Algorithm: Delete (node head) 1. [Start] 2. [Check for empty] If head=null then Show “List is empty” Else if head->next=null then Node temp=head Delete temp Head=null Else Node temp=head Head=temp->next …

Read More

  Algorithm: Insert (node head, value) 1. [Start] 2. Node temp Temp->data=value 3. [Check condition] If head=null then Head=temp Else Node ptr=head Temp->next=ptr Ptr->pre=temp Head=temp [End of if else step …

Read More