Contact

By


Comments

Anonymous said…
LowDekeBall
21 March 2019 at 16:06
Post a Comment

Popular posts from this blog

Finding the K th node from the end using Double Linked List

By
Link for the program in Github is below. #include<stdio.h> #include<stdlib.h> struct node{     int data;     struct node *pdr;     struct node *ndr; }; struct node *start=NULL,*ptr,*nnode=NULL,*ptr2,*ptr3,ptr4; void main() {     int x,n,k;     printf("Enter the data and if entering (-ve) integers it stop taking inputs(data) : \n");     scanf("%d",&x);     while(x>=0)     {         nnode=(struct node*)malloc(sizeof(struct node));         if(start==NULL)         {             nnode->data=x;             nnode->pdr=NULL;             nnode->ndr=NULL;           ...
Read more about dis to earn Knowledge »