Doubly Circular linked list<\/h2>\n<\/div>\n

\n

\n

\n
• Circular doubly linked list is a type of data structure in which a node contain pointers to its previous node as well as the next node.<\/li>\n
• Circular doubly linked list doesn’t contain NULL in any of the node.<\/li>\n
• The last node contains the address of the first node of the list. The first node also contain address of the last node in its previous pointer.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
  \n

  <\/div>\n

  \n

  Sample Code:<\/h2>\n

  <\/div>

  #include<stdio.h>#include <stdlib.h>int main(){   struct node   {      int num;      struct node *ptr;   };   typedef struct node NODE;   NODE *head, *first, *temp=0;   int count = 0;   int choice = 1;   first = 0;   while(choice)   {      head =(NODE*) malloc(sizeof(NODE));      printf("Enter the data item: ");      scanf("%d", &head-> num);      if(first != 0)      {         temp->ptr = head;temp = head;      }      else      {         first = temp = head;      }      fflush(stdin);      printf("Do you want to continue(Type 0 or 1)?\\n\\n");      scanf("%d", &choice);   }   temp->ptr = 0;   temp = first; \/* reset temp to the beginning*\/   printf("\\n Status of the linked list is\\n");   while(temp!=0)   {      printf("%d=>", temp->num);      count++;      temp = temp -> ptr;   }   printf("NULL\\n");   printf("No. of nodes in the list = %d\\n", count);   return 0;}<\/code><\/pre> <\/div>\n
  Output:<\/h2>\n
   
   <\/div> 
  Enter the data item: 10Do you want to continue <Type 0 or 1>?1Enter the data item: 20Do you want to continue<Type 0 or 1>?1Enter the data item: 30Do you want to continue<Type 0 or 1>?0Status of the Linked List is10=>20=>30=>NULLNo.of nodes in the list = 3<\/code><\/pre> <\/div>\n
  \n
  \n
  Advantages of Linked List<\/h2>\n<\/div>\n<\/div>\n
  \n
  \n
  \n
  Linked list is dynamic in nature which allocates the memory when required.<\/li>\n
  In linked list, stack and queue can be easily executed.<\/li>\n
  It reduces the access time.<\/li>\n
  Insert and delete operation can be easily implemented in linked list.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
  \n
  \n
  Disadvantages of Linked List<\/h2>\n<\/div>\n<\/div>\n
  \n
  \n
  \n
  Reverse traversing is difficult in linked list.<\/li>\n
  Linked list has to access each node sequentially; no element can be accessed randomly.<\/li>\n
  In linked list, the memory is wasted as pointer requires extra memory for storage.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
  Answer : A linked list is a sequence of data structures, which are connected…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,3408,971,15897,3430,491,221,368,203,199,214,198,363,3409,3424,3057,3433,3432,205,3301,3316,3303,3410,3304,3411,3302,3312,3431,222,484,3054,196,212,3435,3412,3429,3413,3437,3414,3182,3428,3205,3427,3415,207,366,204,206,972,3416,3417,3418,3419,3420,3421,3422,3425,200,3055,3423,3436,197,3426,968,3056,285,969],"class_list":["post-493","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-algorithm-for-creation-of-singly-linked-list-in-data-structure","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-apostek-software-interview-questions-and-answers","tag-application-of-linked-list-in-data-structure","tag-applied-materials-interview-questions-and-answers","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-circular-linked-list-in-data-structure","tag-circular-linked-list-in-data-structure-program","tag-collabera-te-interview-questions-and-answers","tag-data-structure-projects-using-linked-list","tag-deletion-in-linked-list-in-data-structure","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-doubly-linked-list","tag-doubly-linked-list-deletion","tag-doubly-linked-list-in-c","tag-doubly-linked-list-in-c-source-code","tag-doubly-linked-list-in-data-structure","tag-doubly-linked-list-insertion","tag-doubly-linked-list-java","tag-doubly-linked-list-program-in-data-structure","tag-example-of-linked-list-in-data-structure","tag-flipkart-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-insertion-and-deletion-in-linked-list-in-data-structure","tag-java-linked-list-traversal","tag-linked-list-algorithm-in-data-structure","tag-linked-list-c","tag-linked-list-data-structure-in-c","tag-linked-list-data-structure-in-java","tag-linked-list-in-data-structure","tag-linked-list-in-data-structure-using-c","tag-linked-list-insertion","tag-linked-list-program-in-data-structure","tag-linked-lists-java","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-singly-linked-list-algorithm","tag-singly-linked-list-algorithm-in-data-structure","tag-singly-linked-list-c","tag-singly-linked-list-in-data-structure","tag-singly-linked-list-in-data-structure-program","tag-singly-linked-list-java","tag-singly-linked-list-program-in-c","tag-singly-linked-list-program-in-data-structure","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-types-of-linked-list","tag-types-of-linked-list-in-data-structure","tag-unitedhealth-group-interview-questions-and-answers","tag-what-is-linked-list-in-data-structure","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n