tag:blogger.com,1999:blog-4070434216759110691.post6272150419287458954..comments2024-01-31T09:20:26.818-08:00Comments on codingfreak: Implementation of Doubly Linked List in CUnknownnoreply@blogger.comBlogger8125tag:blogger.com,1999:blog-4070434216759110691.post-37886265218201352812013-04-10T10:36:30.801-07:002013-04-10T10:36:30.801-07:00Nice lesson Nice lesson Rattanahttps://www.blogger.com/profile/01840653976066868896noreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-26261108930891305302013-02-12T17:00:11.790-08:002013-02-12T17:00:11.790-08:00I have updated the code with calloc operation so t...I have updated the code with calloc operation so that we dont need to do memset operation.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-59484270272133402032013-01-16T19:21:29.035-08:002013-01-16T19:21:29.035-08:00Since we are using malloc function we are just mak...Since we are using malloc function we are just making sure that memory allocated have NULL value inside it so we are doing memsetAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-84144942951792142642013-01-16T08:24:50.361-08:002013-01-16T08:24:50.361-08:00//if(newNode)
memset(newNode, 0, sizeof(...//if(newNode) <br /> memset(newNode, 0, sizeof(newNode)); <br /><br />can u please explain what this condition means?..thanks in advance<br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-57020320484282158852012-07-01T20:04:46.157-07:002012-07-01T20:04:46.157-07:00Thanks for finding out the error .. I have updated...Thanks for finding out the error .. I have updated the sameAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-39977167502108050752012-06-30T19:13:55.008-07:002012-06-30T19:13:55.008-07:00In create_head
//NODE *head = (HEAD *)malloc(size...In create_head <br />//NODE *head = (HEAD *)malloc(sizeof(HEAD)); <br /><br />Why Head is a pointer to Node ?<br /><br />why can't it be like this ?<br />HEAD *head = (HEAD *)malloc(sizeof(HEAD));Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-38042361269767861742012-03-24T06:01:59.722-07:002012-03-24T06:01:59.722-07:00There are many ways to implement it .. For example...There are many ways to implement it .. For example check the article on Circular Doubly Linked List (which I am gonna write soon) will even help to make things much easier using a doubly linked listAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-4070434216759110691.post-13061588624969870842012-03-23T21:57:08.342-07:002012-03-23T21:57:08.342-07:00Quite nice idea to store the count of number of no...Quite nice idea to store the count of number of nodes in the list. My teacher told me that the head has no data but only link to the next node. Thanks for this great idea.Akash @ Computer definitionshttp://www.defit.orgnoreply@blogger.com