pertemuan ke-2 - Single Link List - 2101640795 - Michael Kesta


Single Linked List
Single linked list is a sequence of elements in which every element has link to its next element in the sequence. In any single linked list, the individual element is called as "Node". Every "Node" contains two fields, data and next. The data field is used to store actual value of that node and next field is used to store the address of the next node in the sequence.Example:
http://btechsmartclass.com/DS/images/Linked%20List%20Example.png

Operation
In a single linked list we perform the following operations...
  1. Insertion
  2. Deletion
  3. Display
Before we implement actual operations, first we need to setup empty list. First perform the following steps before implementing actual operations.
  • Step 1: Include all the header files which are used in the program.
  • Step 2: Declare all the user defined functions.
  • Step 3: Define a Node structure with two members data and next
  • Step 4: Define a Node pointer 'head' and set it to NULL.
  • Step 4: Implement the main method by displaying operations menu and make suitable function calls in the main method to perform user selected operation.
Insertion
In a single linked list, the insertion operation can be performed in three ways. They are as follows...
  1. Inserting At Beginning of the list
  2. Inserting At End of the list
  3. Inserting At Specific location in the list
Inserting At Beginning of the list
We can use the following steps to insert a new node at beginning of the single linked list...
  • Step 1: Create a newNode with given value.
  • Step 2: Check whether list is Empty (head == NULL)
  • Step 3: If it is Empty then, set newNode→next = NULL and head = newNode.
  • Step 4: If it is Not Empty then, set newNode→next = head and head = newNode.
Inserting At End of the list
We can use the following steps to insert a new node at end of the single linked list...
  • Step 1: Create a newNode with given value and newNode → next as NULL.
  • Step 2: Check whether list is Empty (head == NULL).
  • Step 3: If it is Empty then, set head = newNode.
  • Step 4: If it is Not Empty then, define a node pointer temp and initialize with head.
  • Step 5: Keep moving the temp to its next node until it reaches to the last node in the list (until temp → next is equal to NULL).
  • Step 6: Set temp → next = newNode.
Inserting At Specific location in the list (After a Node)
We can use the following steps to insert a new node after a node in the single linked list...
  • Step 1: Create a newNode with given value.
  • Step 2: Check whether list is Empty (head == NULL)
  • Step 3: If it is Empty then, set newNode → next = NULL and head = newNode.
  • Step 4: If it is Not Empty then, define a node pointer temp and initialize with head.
  • Step 5: Keep moving the temp to its next node until it reaches to the node after which we want to insert the newNode (until temp1 → data is equal to location, here location is the node value after which we want to insert the newNode).
  • Step 6: Every time check whether temp is reached to last node or not. If it is reached to last node then display 'Given node is not found in the list!!! Insertion not possible!!!' and terminate the function. Otherwise move the temp to next node.
  • Step 7: Finally, Set 'newNode → next = temp → next' and 'temp → next = newNode'

Deletion
In a single linked list, the deletion operation can be performed in three ways. They are as follows...
  1. Deleting from Beginning of the list
  2. Deleting from End of the list
  3. Deleting a Specific Node
Deleting from Beginning of the list
We can use the following steps to delete a node from beginning of the single linked list...
  • Step 1: Check whether list is Empty (head == NULL)
  • Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not possible' and terminate the function.
  • Step 3: If it is Not Empty then, define a Node pointer 'temp' and initialize with head.
  • Step 4: Check whether list is having only one node (temp → next == NULL)
  • Step 5: If it is TRUE then set head = NULL and delete temp (Setting Empty list conditions)
  • Step 6: If it is FALSE then set head = temp → next, and delete temp.
Deleting from End of the list
We can use the following steps to delete a node from end of the single linked list...
  • Step 1: Check whether list is Empty (head == NULL)
  • Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not possible' and terminate the function.
  • Step 3: If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize 'temp1' with head.
  • Step 4: Check whether list has only one Node (temp1 → next == NULL)
  • Step 5: If it is TRUE. Then, set head = NULL and delete temp1. And terminate the function. (Setting Empty list condition)
  • Step 6: If it is FALSE. Then, set 'temp2 = temp1 ' and move temp1 to its next node. Repeat the same until it reaches to the last node in the list. (until temp1 → next == NULL)
  • Step 7: Finally, Set temp2 → next = NULL and delete temp1.
Deleting a Specific Node from the list
We can use the following steps to delete a specific node from the single linked list...
  • Step 1: Check whether list is Empty (head == NULL)
  • Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not possible' and terminate the function.
  • Step 3: If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize 'temp1' with head.
  • Step 4: Keep moving the temp1 until it reaches to the exact node to be deleted or to the last node. And every time set 'temp2 = temp1' before moving the 'temp1' to its next node.
  • Step 5: If it is reached to the last node then display 'Given node not found in the list! Deletion not possible!!!'. And terminate the function.
  • Step 6: If it is reached to the exact node which we want to delete, then check whether list is having only one node or not
  • Step 7: If list has only one node and that is the node to be deleted, then set head = NULL and delete temp1 (free(temp1)).
  • Step 8: If list contains multiple nodes, then check whether temp1 is the first node in the list (temp1 == head).
  • Step 9: If temp1 is the first node then move the head to the next node (head = head → next) and delete temp1.
  • Step 10: If temp1 is not first node then check whether it is last node in the list (temp1 → next == NULL).
  • Step 11: If temp1 is last node then set temp2 → next = NULL and delete temp1 (free(temp1)).
  • Step 12: If temp1 is not first node and not last node then set temp2 → next = temp1 → next and delete temp1 (free(temp1)).


Komentar

Posting Komentar

Postingan populer dari blog ini

Pertemuan ke-4 - Binary tree and expression - 2101640795 - Michael Kesta

Gambar
Binary Tree In  computer science , a  binary tree  is a  tree   data structure  in which each node has at most two  children , which are referred to as the  left child  and the  right child . A  recursive definition  using just  set theory  notions is that a (non-empty) binary tree is a  tuple  ( L ,  S ,  R ), where  L  and  R  are binary trees or the  empty set  and  S  is a  singleton set . [1]  Some authors allow the binary tree to be the empty set as well. Types of binary tree ·          A  rooted ·          A  full  binary tree ·          A  perfect  binary tree ·          In a  complete  binary tree every level ·          In the  infinite complete  binary tree ·          A  balanced  binary tree ·          A  degenerate  (or  pathological ) tree Full binary tree Complete binary tree Binary Expression tree A  binary expression tree  is a specific kind of a  binary tree  used to represent expressions. Two common types of expressions th
Baca selengkapnya

Pertemuan ke-3 - Link List Implementation - 2101640795 - Michael Kesta

Infix, Postfix and Prefix Infix, Postfix and Prefix notations are three different but equivalent ways of writing expressions. It is easiest to demonstrate the differences by looking at examples of operators that take two operands. Infix notation: X + Y Operators are written in-between their operands. This is the usual way we write expressions. An expression such as  A * ( B + C ) / D  is usually taken to mean something like: "First add B and C together, then multiply the result by A, then divide by D to give the final answer." Postfix notation (also known as "Reverse Polish notation"): X Y + Operators are written after their operands. The infix expression given above is equivalent to  A B C + * D / The order of evaluation of operators is always left-to-right, and brackets cannot be used to change this order. Because the "+" is to the left of the "*" in the example above, the addition must be performed before the multiplication.
Baca selengkapnya