Introduction to Linked List_dsa_inC.pptx

DSA

1. Linked list

2. Disadvantages of Arrays: Fixed size (static in nature) In efficient memory allocation and utilization Slow insertion or deletion time

3. How to maintain this list in memory

4. Definition of linked list: Linked List can be defined as a collection of objects Objects called nodes that are randomly stored in the memory. A node contains two fields data link Data field stores data/information at that particular address and the link or pointer or address field which contains the address of the next node in the memory.

5. Types of linked lists: Single linked list: Navigation is forward. Double linked list: Forward and backward navigation is possible. Circular linked list: The last element is linked to the first element.

6. Singly Linked List

7. Representation of Single Linked List

8. Let's see how each node of the linked list is represented. Each node consists: A data item An address of another node

9. How to Create a node of the List?

10. Head->Link ? Head -> Link -> Link ?

11. Final Code

12. Traversing a Single Linked List (Counting the Nodes)

13. Traversing a Single Linked List (Printing the Data)

14. Inserting a Node at the End

15. Inserting a Node at the Begining

16. Inserting a Node at a Certain Position

17. Step 1: Create a new node

18. Step 2: Traversal

19. Deleting the First Node

20. Deleting the Last Node

21. Deleting the Node at a Particular Position