11/28/2020 (c) Dr. Jyoti Lakhani 1 Linked List Linear Data Structure Store more than one value in it (Same as array) 11 12 13 start First Node Last Node pointer Node Node Node NULL
11/28/2020 (c) Dr. Jyoti Lakhani 2 Difference between Array and Linked List
11/28/2020 (c) Dr. Jyoti Lakhani 3 Operations of Linked List Create a Node Insert Node at Beginning of Linked List Insert Node at End of Linked List Insert at a given Location Insert after or before a given Node Deletion from Beginning Deletion from End Deletion from a given location Deletion from before or after a given node Search an item in Linked List Traverse Linked List Display Linked List Count nodes in a Linked List
11/28/2020 (c) Dr. Jyoti Lakhani 4 Structure of a Node 11 Info Next struct Node { int info; struct Node *next; };
11/28/2020 (c) Dr. Jyoti Lakhani 5 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL Info Next new_node
11/28/2020 (c) Dr. Jyoti Lakhani 6 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL Info Next 11 Value = new_node
11/28/2020 (c) Dr. Jyoti Lakhani 7 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL 11 Info Next NULL new_node

Ds06 linked list- intro and create a node

  • 1.
    11/28/2020 (c) Dr.Jyoti Lakhani 1 Linked List Linear Data Structure Store more than one value in it (Same as array) 11 12 13 start First Node Last Node pointer Node Node Node NULL
  • 2.
    11/28/2020 (c) Dr.Jyoti Lakhani 2 Difference between Array and Linked List
  • 3.
    11/28/2020 (c) Dr.Jyoti Lakhani 3 Operations of Linked List Create a Node Insert Node at Beginning of Linked List Insert Node at End of Linked List Insert at a given Location Insert after or before a given Node Deletion from Beginning Deletion from End Deletion from a given location Deletion from before or after a given node Search an item in Linked List Traverse Linked List Display Linked List Count nodes in a Linked List
  • 4.
    11/28/2020 (c) Dr.Jyoti Lakhani 4 Structure of a Node 11 Info Next struct Node { int info; struct Node *next; };
  • 5.
    11/28/2020 (c) Dr.Jyoti Lakhani 5 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL Info Next new_node
  • 6.
    11/28/2020 (c) Dr.Jyoti Lakhani 6 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL Info Next 11 Value = new_node
  • 7.
    11/28/2020 (c) Dr.Jyoti Lakhani 7 Create a Node Algorithm : Create_Node(value for New Node) Input : Accepts info to be inserted in the node Output: Returns a node with given info Steps: 1. [Allocate Memory to New Node] new_node = new Node 2. [Insert Info in Node] new_node->info = value 3. [Initialize next pointer of node] 1. new_node->next = NULL 11 Info Next NULL new_node