Single Linked List


First of all, what is Linked List? Linked List is pretty similar to array, but Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers.


///Then, what is special about Linked Lists? Are they are just similar to Array?///


Even though array and linked lists are pretty similar, but there is some differences between arrays and linked lists. Here is the difference between array and linked list.

Image result for difference between array and linked list


What is Single Linked List? Single Linked List is a type of Linked Lists that only have a single pointer variable that points to the next element that will leads to the tail of Linked List, and the tail will points NULL. 

here is the illustration of Single Linked List :

P. S. : Head is the first element of Linked List and Tail is the last element of Linked List

example of 'struct' code :

struct Scholar{
      char name[25];
      int age;
      struct Scholar *next;
}*head,*tail;

Memory Allocation in Linked List

In C or C++ programming language, we could use 'malloc' for allocating the memory, and for delete the allocation memory we could use 'free'. The 'free' function usage is for clearing the memory allocation, but not the value of the element in Linked List.

Here is an example of malloc usage :


Insertion and Deletion of Nodes in Single Linked List

Insertion (also known as push) and deletion (also known as pop) is executed in the head, tail or even in the middle of linked list
  • Insertion on Head of Linked List
This function is used for inserting or adding the element at the head of Linked List.
Here is the example of code for Insertion at Head :

 /// Insertion at Head of Linked List in C///
  • Insertion on Tail of Linked List
This function is used for inserting or adding the element at the tail of Linked List.
Here is the example of code for Insertion at Tail :

/// Insertion at Tail of Linked List in C///
  • Insertion at Middle of Linked List
This function is used for inserting or adding the element at the middle of Linked List.
Here is the example of code for Insertion at Middle :

/// Insertion at Middle of Linked List in C///


  • Deletion at Head of Linked List
This function is used for deleting the element at the head of Linked List.
Here is the example of code for Deletion at Head : 

/// Deletion at Head of Linked List in C///

  • Deletion at Middle of Linked List
This function is used for deleting the element at the middle of Linked List.
Here is the example of code for Deletion at Middle :

/// Deletion at Middle of Linked List in C///

  • Deletion at Tail of Linked List
This function is used for deleting the element at the tail of Linked List.
Here is the example of code for Deletion at Tail :

/// Deletion at Tail of Linked List in C///


Source :
3.  https://pediaa.com/wp-content/uploads/2018/12/Difference-Between-Array-and-Linked-List-  Comparison-Summary.jpg

Komentar

Posting Komentar

Postingan populer dari blog ini

Heap and Tries

Gambar
What is HEAP? A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. For example, if  X  is the parent node of  Y , then the value of  X  follows a specific order with respect to the value of  Y  and the same order will be followed across the tree. The maximum number of children of a node in a heap depends on the type of heap. However, in the more commonly-used heap type, there are at most  2  children of a node and it's known as a binary heap. In a binary heap, if the heap is a complete binary tree with  N  nodes, then it has the smallest possible height which is  l o g 2 N . Illustration of Heap In the diagram above, you can observe a particular sequence, i.e each node has greater value than any of its children. Suppose there are  N  Jobs in a queue to be done, and each job has its own priority. The job with maximum priority will get completed first than others. At each instant, we are completing a job with maxi
Baca selengkapnya

AVL Tree

Gambar
What is an AVL Tree? An AVL tree is a subtype of binary search tree. Named after it's inventors Adelson, Velskii and Landis, AVL trees have the property of dynamic self-balancing in addition to all the properties exhibited by binary search trees. A BST is a data structure composed of nodes. It has the following guarantees: Each tree has a root node (at the top). The root node has zero, one or two child nodes. Each child node has zero, one or two child nodes, and so on. Each node has up to two children. For each node, its left descendants are less than the current node, which is less than the right descendants. AVL trees have an additional guarantee: The difference between the depth of right and left subtrees cannot be more than one. In order to maintain this guarantee, an implementation of an AVL will include an algorithm to rebalance the tree when adding an additional element would upset this guarantee. AVL trees have a worst case lookup, insert and delete time of O(log
Baca selengkapnya