Double Linked List (Algorithm)

Double Linked List (Algorithm)

• 1.
  Presented By: Warda Aziz(101631058) Huba Akhtar(101631022) Shifa Idrees (101631049) Amber Wajid (101631002) Group No: 05 Double Linked List
• 2.
  TOC: • LIST • LINKEDLIST • PICTORIAL REPRESENTATION • ADVANTAGES • DISADVANTAGES • DOUBLE LINKED LIST • EXPLANATION • POINTS TO BE NOTED • OPERATIONS • INSERTION • DELETION • DISPLAY • CODE • ADVANTAGES • DISADVANTAGES
• 3.
  List???
• 4.
  Definition: A list isa collection of same type of objects. It can be :  linked list  double linked list  circular linked list  double and circular linked list
• 5.
  linked list
• 6.
  Definition: • A datastructure that consists of a sequence of data record such that in each record there is a field that contains a reference of next record in a sequence.
• 7.
  A sequence ofdata structures, which are connected together via links. Linked list is a sequence of links which contains items. Each link contains a connection to another link.
• 8.
  Pictorial Representation head node End node
• 9.
  ADVANTAGES 4: No needto define initial size of the list 3: Addition/removal from the mi ddle 1: Stacks and queues can be impleme nted 2: Insertion and deletion is faster
• 10.
  Disadvantages More memory thanarrays! sequential order, read from the beginning time to access individual elements one way direction reverse traversing!!!
• 11.
  Double linked list
• 12.
  Definition: Double linked listis a sequence of elements in which every element has links to its previous element and next element in the sequence.. Or Double linked list is a two-way list because one can move in either from left to right or fr om right to left.
• 13.
  Explanation: Every node haslink to its previous node and next node . So , we can traverse forward by using next field and can traverse backward by using previous field. Every node in double linked list contains three fields.
• 14.
  value of thatnode Points to a previous node points to next node
• 15.
  Example: N 2 3 1 1 3 2 5N N Fron t
• 16.
  P O IN T S T O B E N O T E D :  In double linked list ,the first node must be always pointed by HEAD. Always the previous field of the first node must be NULL. Always the next field of the last node must be NULL.
• 17.
  Operations: In a doublelinked list , we perform the following operations… 1. Insertion 2. Deletion 3. Display
• 18.
  Insertion: In double linkedlist ,the insertion operation ca n be performed in three ways as follows… 1. Inserting At Beginning of the list 2. Inserting At End of the List 3. Inserting At Specific Location in the list
• 19.
  Deletion : In doublelinked list ,the deletion operation ca n be performed in three ways as follows… 1. Deletion At Beginning of the list 2. Deletion At End of the List 3. Deletion At Specific Location in the list
• 20.
  Displaying: Double linked listcan be Displayed by writing a Piece of Code in your Program..
• 21.
  Engine Tail EngineCabins
• 22.
  • We canInsert a cabin • We can Remove Cabin in the Same Way • We can put passengers in the cabin from different positions • We can check them out • We can change them • We can and have to check its state at each time
• 23.
  • A Passenger •A Front Gate Administrator • A Back Gate Administrator Value Previous Node Next Node
• 24.
  ADVANTAGES:- 1) We cantraverse in both direction i.e from starting to end & as well as from end to starti ng. 2) It is easy to reverse the linked list. 3) If we are at a node, the we can go at any node. But in linked list , it is not possible to r each the previous node.
• 25.
  Disadvantages: 1) it requiresmore space per node because extra fie ld is required for pointer to previous node. 2) Insertion and deletion take more time than line a re linked list because more pointer operations are r equired than linear linked list