I was told that something could be done like that, but it’s confusing, I don’t quite understand:
struct Node{ int value; Node* next; Node* prev; }; void insert(Node*n, int val) { Node*a = new Node; n->next = a; a->next = n->next; a->value = val; n->value = a->value; } 
Then so:
void insert(Node*n, int val) { Node*a = new Node; a->value = val; a->next = n->next; n->next = a; a->prev = n; // Не нужно для односвязного списка if (a->next) a->next->prev = a; // Не нужно для односвязного списка } Those. you simply insert a new node after n , updating the fields n and a accordingly. n now points to a , and a - where n used to point.
Source: https://ru.stackoverflow.com/questions/722537/
All Articles
forward_listis aforward_listlinked list. It should not have a link to the previous item. And if there is such a link, then this is already a doubly linked list, i.e.list- zed