Unit 5. LinkedList

Topics Covered

  1. Concept and Definition
  2. Inserting and Deleting nodes
  3. Linked implementation of a stack (PUSH/POP)
  4. Linked implementation of a queue (Insert/Remove)
  5. Circular List
    1. Stack as a circular list (PUSH/POP)
    2. Queue as a circular list (Insert/Remove)
  6. Doubly Linked List (Insert/Remove)


Leave a comment

Leave a Reply

Your email address will not be published. Required fields are marked *

*