Today Topic





Data Structure : Doubly Linked List 


Doubly linked list is a collection of nodes linked together in a sequential way. Each node of the list contains two parts data part and reference/address part. The basic structure of node is shown in the below image:


Doubly linked list is almost similar to singly linked list except it contains two address or reference fields, where one of the address field contains reference of the next node and other contains reference of the previous node. First and last node of linked list contains a terminator generally a NULL value, that determines the start and end of the list. Doubly linked list is sometimes also referred as bi-directional list since it allows traversal of nodes in both direction. The basic structure of a doubly linked list is represented as:


Since doubly linked list allows the traversal of nodes in both direction hence we can keep track of both first and last nodes.

The implementation   of doubly linked list in C programming language :


struct node {
      int data; // Data field
      struct node *prev; //Address previous node
     struct node *next; //Address next node
};

Data Structure: Circular Linked List



A circular linked list is basically a linear list that may singly or doubly. The only difference between doubly linked list is that there is no any NULL value to terminating the list. in fact in the list every node points to the next node and last node points to the first node, thus forming a circle.Since it forms a circle with no end stop hence it called as circular linked list.


C program to insert a new node in a circular Linked List:


 //Basic structure of node

struct node {
      int data;
      struct node *next;
}*head;

//Create a circular linked list of n nodes.
void(createList(int n)
{
    int i, data;
    struct node *prevNode, *newNode;

    if(n ?= 1)
    {
        head = (struct node *)malloc(sizeof(struct node));

        printf("Enter data of 1 node: ");
        scanf("%d", &data);
        head->data =data;
        head->next =NULL;
        prevNode = head;
       
//creates and links rest of the n-1 nodes

            for(i = 2; i<=n; i++)
             {
                 newNode =  (struct node *)malloc(sizeof(struct node));               
                 printf("Enter data of %d node: ", i);
                 scanf("%d", &data;
                 newNode->data = data;
                 newNode -> NULL;

                 prevNode->next = newNode; //Links the previous node with newly created node
                 prevNode = newNode; //Moves the previous node ahead
                 }
               
                 prevNode -> =head; //Links the last node with first node
                 printf("\nCIRCULAR LINKED LIST CREATED SUCCESFULLY\N);
               


source:
https://codeforwin.org/2015/10/doubly-linked-list-data-structure-in-c.html
https://codeforwin.org/2015/11/circular-linked-list-data-structure.html
https://codeforwin.org/2015/11/c-program-to-insert-node-in-circular-linked-list.html

Comments

Post a Comment

Popular posts from this blog

Pengertian kelas besar tentang head, curr, tail

Image
  The topic I learn today in Big class is about the concept position of where will our pointer be directed at when we have head, curr, and tail.   Let say we have a singly link list that we want to make a push insertion.To make it happen we need to know where our address is first before we start making push insertion. The push insertion will be pushing from the front(beginning) and make a pop will be delete address. struct node{   int data; // value   struct node *next, *prev; // address }*head,*curr,*tail; void push(int a) {     curr = (struct Data*)malloc(sizeof(struct Data));//create address     curr->value = a;//insert value input a         if(head==NULL){// if head don have any address then we create one         head = tail = curr;     }     else{         tail->next = curr;// move tail to curr         curr->...
Read more

AVL TREE

Image
AVL TREE is pretty similar to binary search tree but AVL can adjust the balance of the tree automatically The root of the node AVL tree is 0 The leaf of the right or leaf of the left is 1. if the leaf is more than 1 the tree will automatically adjust the balance The above picture is from the right node input and will be rotating to the left. and this other picture is node from the left side and the rotation will be going to the right. the correct solution of the wrong AVL tree is below:- here another example :- Example of Single rotation below example of Doubly rotation Source: https://www.tutorialspoint.com/data_structures_algorithms/avl_tree_algorithm.htm https://en.wikipedia.org/wiki/File:AVL_Tree_Example.gif AVL TREE PPT binus https://www.cs.usfca.edu/~galles/visualization/AVLtree.html
Read more

Binary Search Tree(BNS)

Image
BNS is also known as versions of sorted version of binary tree for the node of the left subtree is contain smaller number than those store in x for the node of the right subtree is contain greater number than those store in x there are three operation in BNS: insert() search() remove() The insert of BNS is to store is done recursively. let the new node's key be X, then we have a number of 30 of the beginning of the first node. if the node key input is smaller it will move the node to the left subtree side, if the node key is greater than it will move to the right subtree side. here is the example:- Now we will discuss search of BNS or can be call find of BNS. The search is pretty easy it just finds the node key of the X in the tree. if the search found the node it search then it will print the "the node key is found in the tree". The search algorithm is pretty much similar to insert but it job not to insert but to find only. La...
Read more