StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POCan't delete the node from the end of a linked list
primarykey
Id
5985785
data
AcceptedAnswerId
5985870
AnswerCount
1
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-05-12T23:42:03.703
FavoriteCount
0
LastActivityDate
2015-02-11T04:47:38.860
LastEditDate
2015-02-11T04:47:38.860
LastEditorUserId
3366929
OwnerUserId
743898
ParentId
0
PostTypeId
1
Score
0
ViewCount
358
LastEditorDisplayName
text
Body
<p>I have a problem about deleting the last node of my linked list. I put printf functions to check and locate the error but I can't find it. This my code for deleting the last node from an unsorted linked list. At the end you will see four add functions and they are working successfully. The only broken part is deleting from the end. </p> <pre><code>void del_Node(LIST* list, int counter) { if( counter == 0 ) return; NODE* temp = list->header; int count=1; if( list->header == NULL ) { printf("The list is already EMPTY\n"); return; } while( count != counter ) { temp = temp->next; count++; } printf("%s %s\n", temp->first_name, temp->last_name); if( list->counter == 1 ) { // Condition for deleting the last node of the linked list list->header = NULL; list->tail = NULL; temp->next = NULL; temp->pre = NULL; list->counter--; } else if( list->header == temp ) { // Condition for deleting from the beginnig list->header = temp->next; printf("%s listenin basından silindi\n", temp->first_name); temp->next = NULL; temp->pre = NULL; list->counter--; } else if ( list->tail == temp ) { // Condition for deleting from the end list->tail = temp->pre; printf("%s normal listenin tailinden silindi yeni tail %s\n", temp->first_name, temp->pre->first_name); temp->next = NULL; temp->pre = NULL; list->counter--; } else { // Condition from deleting from the middle temp->pre->next = temp->next; temp->next->pre = temp->pre; printf("%s normal listede %s------%s arasından silindi\n",temp->first_name, temp->next->first_name, temp->pre->first_name); temp->next = NULL; temp->pre = NULL; list->counter--; } del_fn_name(list, temp); del_ln_name(list, temp); del_bdt(list, temp); del_city(list, temp); free(temp); printf("List->counter = %d %d %d\n", list->counter, list->fn_count, list->ln_count ); } </code></pre>
Tags
<c><list><data-structures><linked-list>
Title
Can't delete the node from the end of a linked list
singulars
PostAcceptedAnswerId
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USquartaela
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
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  POCan't delete the node from the end of a linked list
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTApproveEditSuggestion
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.