singly-linked-list

问题 I'm implementing linked lists using structures. I have a structure - typedef struct llist node; typedef node *nodeptr; struct llist { int data; nodeptr next; }; Now lets say I declare a variable nodeptr *ptr; . How do I access the members data and next using ptr ? 回答1: You deference the first pointer and then the second one. To access the data and next in the structure statement would like this (*ptr)->data = 5; (*ptr)->next = temp; brackets around ptr is required since -> has higher priority

问题 I'm implementing linked lists using structures. I have a structure - typedef struct llist node; typedef node *nodeptr; struct llist { int data; nodeptr next; }; Now lets say I declare a variable nodeptr *ptr; . How do I access the members data and next using ptr ? 回答1: You deference the first pointer and then the second one. To access the data and next in the structure statement would like this (*ptr)->data = 5; (*ptr)->next = temp; brackets around ptr is required since -> has higher priority

问题 I am writing a C code to find the middle of linked list. I understood the logic but was unable to figure out how pointers are being used. What is the difference in the way Node *head and Node** head_ref work? void middle(struct Node *head) ; void push(struct Node** head_ref, int new_data) ; 回答1: In the first function header, *head is a pointer to a node object which is allocated somewhere in memory: void middle(struct Node *head); _____________________ | | *head --> | Node object | | [val=1][

问题 I'm trying to implement a function that deletes nodes from a linked list. So far, I can delete just the first node of the list(3). I tried to go to the for loop from delete, I thought that the memory is not well allocated, I have been struggling for a few days and I don't understand, please help me a little, it's the topic I received from college. #include <stdio.h> #include <stdlib.h> typedef struct nod { int key; struct nod *urm; } NOD; NOD *first=0,*last=0; void add(int x) { NOD *p=(NOD*

问题 I'm trying to implement a function that deletes nodes from a linked list. So far, I can delete just the first node of the list(3). I tried to go to the for loop from delete, I thought that the memory is not well allocated, I have been struggling for a few days and I don't understand, please help me a little, it's the topic I received from college. #include <stdio.h> #include <stdlib.h> typedef struct nod { int key; struct nod *urm; } NOD; NOD *first=0,*last=0; void add(int x) { NOD *p=(NOD*

问题 I have been trying to think a way to traverse a single linked list. This is so far what I have done: #include <iostream> typedef struct node { int data; // will store information node *next; // the reference to the next node }; int printList(node *traverse) { if (traverse->next == NULL) { return -1; } traverse=traverse->next; printList(traverse); cout << traverse->data << endl; return 0; } int main() { node *head = NULL; for (int i = 0; i < 10; i++) { node *newEntry = new node; newEntry->data

问题 In C I have to write a bubble sort function that swaps the nodes and not the values of a LinkedList, but I'm unable to accomplish it. Here is the code (As you can see the order is not correct): #include <stdio.h> #include <malloc.h> // malloc, free #include <stddef.h> // NULL // defining 'int' as data_t typedef int data_t; typedef struct node_s { data_t data; struct node_s* next; } node_t; node_t** list_new() { node_t** list = malloc(sizeof **list); if (!list) return NULL; *list = NULL;

问题 In C I have to write a bubble sort function that swaps the nodes and not the values of a LinkedList, but I'm unable to accomplish it. Here is the code (As you can see the order is not correct): #include <stdio.h> #include <malloc.h> // malloc, free #include <stddef.h> // NULL // defining 'int' as data_t typedef int data_t; typedef struct node_s { data_t data; struct node_s* next; } node_t; node_t** list_new() { node_t** list = malloc(sizeof **list); if (!list) return NULL; *list = NULL;

问题 I want to create and delete a node from the singly linked list in java. The deleting method will take the index of node and delete that node. The logic is working but it is not deleting the node at first index (0) how do i modify this code so that it can delete node at any position without using extra loops. I know that I am using starting index as 1 in code but I can not riddle this that if entered index is zero then how the program can delete the "previousNode" using the same loop. It will

问题 I'm stuck on this particular function that frees all even nodes from the linked list. I've figured out how to free all the nodes from a linked list but I cannot figure this out. The code i'm posting is very wrong. What I don't understand is how to use a node *temp variable and link it to the head->next node, as the head is what is being freed (because it is even). Also, at the end of the while loop, I know that I need to increment to the next node in the list, but I seem to be doing that