StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POhow to free memory for doubly linked list program in c
primarykey
Id
14444440
data
AcceptedAnswerId
0
AnswerCount
2
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-01-21T17:51:33.963
FavoriteCount
1
LastActivityDate
2015-02-11T05:13:06.077
LastEditDate
2015-02-11T05:13:06.077
LastEditorUserId
3366929
OwnerUserId
1289810
ParentId
0
PostTypeId
1
Score
2
ViewCount
1740
LastEditorDisplayName
text
Body
<p>Past few days I'm working on my c\c++ skills. I was going through my Data structure book and then I thought why not implement doubly linked list program. I wrote the program; surprisingly it work fine too, but , I'm not sure whether I've written it correctly. I'm not able to figure it out how to free the memory I've allocated. Please help me with this guys. </p> <p>Also if any of you can explain me this "while(linkNode!=0)", i'll be really thankfull.</p> <pre><code>#include<stdio.h> #include<malloc.h> struct node { int x; struct node * next; struct node * prev; }; struct head { unsigned int count; struct node * hd; struct node * tl; }; void main() { int i =0; struct node * linkNode; struct head *hdd; hdd = (head *)malloc(sizeof(head)); linkNode = (node *) malloc(sizeof(node)); hdd->count = 1; hdd->hd = linkNode; linkNode->prev = 0; linkNode->next = 0; linkNode->x = 0; for(;i<10;i++) { linkNode->next = (node *) malloc(sizeof(node)); linkNode->next->prev = linkNode; linkNode = linkNode->next; linkNode->next = 0; linkNode->x = i; hdd->count+=1; hdd->tl = linkNode; } linkNode = hdd->hd; printf("priniting in next direction\n"); while(linkNode!=0) { printf("%d\n",linkNode->x); linkNode = linkNode->next; } linkNode = hdd->tl; printf("priniting in prev direction\n"); while(linkNode!=0) { printf("%d\n",linkNode->x); linkNode = linkNode->prev; } linkNode = hdd->hd; while(linkNode!=0) { free(linkNode->prev); linkNode = linkNode->next; } free(hdd); } </code></pre>
Tags
<c><list><memory><linked-list><allocation>
Title
how to free memory for doubly linked list program in c
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USHemant
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
2. PO
  singulars
  PostTypePostTypeId
  PTAnswer
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  POhow to free memory for doubly linked list program in c
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.