week 5 and week 6

• Linked List - It’s a Linear data Structure
• Linked List - It’s a Series of connected nodes
• Node – Each element in a link list and it consist of 3 fields
• Previews – stores an address of the previews element in the list, it is also null for the first element
• Head – First node
• Null – Last node
• Methods of Link List –

  1. Add Elements
  2. Change Elements
  3. Access Elements
  4. Remove Elements
• Singly Linked List – Most common and each node has data and a pointer to the next node.
• Circular Linked List – a variation in which the last element is linked to the first element, it Forms a circular loop. Can be either singly or doubly linked
• Doubly Linked List – can go in either direction forward or backward.
• 1. Next – stores an address for the next element in the list, it is also null for the last element.
• Data - stores the actual data