Skip to content
December 8, 2019

One Click Info

We Give You Every Kind Of Information

  • HOME
  • Programming
    • Data Structure
      • Queue
      • Stack
      • Link list
      • Doubly link list
    • Java
      • Sequence Structure
  • Tips & Triks
    • Computer Tricks
    • Mobile
    • Subjects
  • About Us
Main Menu

Doubly link list

Doubly link list

Write an algorithm “Insert At Mid Point” in doubly link list.

November 18, 2019 - by admin - Leave a Comment

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
Doubly link list

Write an algorithm of “Delete At Last Point” in doubly link list

November 18, 2019 - by admin - Leave a Comment

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
Doubly link list

Write an algorithm of “Insert At Last Point” using doubly link list

November 18, 2019 - by admin - Leave a Comment

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
Doubly link list

Write an algorithm to “Delete At Starting Point” using Doubly link list

November 18, 2019 - by admin - Leave a Comment

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
Doubly link list

Write an algorithm to “Insert At Starting Point” in Doubly link list

November 18, 2019 - by admin - Leave a Comment

  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
Copyright © 2019 One Click Info.
Powered by WordPress and HitMag.