You should not execute delete on a node that is still in the linked list. First you need to rewire any references to it. That is to say, the node before should have its nextPtr redirected to the node after the one that is to be deleted, and that node should have its beforePtr redirected … Read more
They mistake was with the constructor function, it was just an typo. Because of which the head and tail pointers were not initializing and when the head pointer was compared against the nullptr in the if condition of the addToHead(), program was crashing. solved template program crashing during execution
Describe the algorithm to swap two adjacent elements by adjusting only the links (and not the data) using: a, singling link list b, doubling link list solved Describe the algorithm to swap two adjacent elements by adjusting only the links (and not the data) using: a, singling link list b, doubling link list
You delete the malloc‘ed data. You need to free it instead, or use new instead of malloc. Another bug is that you miss this line: void removeFirst(){ // If head is equal to NULL, do nothing if(head == NULL){ return; } // Store current head Node *tmp = head; // Set head equal to the … Read more
DLLNode is a user defined class just like your Doublylinkedlist class. A possible example of what that DLLNode class might look like: public class DLLNode { int data; DLLNode next; DLLNode prev; public DLLNode(int data) { this.data = data; this.next = null; this.prev = null; } } 7 solved Can’t understand Java doubly linked list … Read more
On this line: *head->prev=temp; The -> operator has higher precedence than the * operator, so it parses as: *(head->prev)=temp; This is invalid because head is a pointer-to-pointer-to-struct, not a pointer-to-struct. You need to add parenthesis to force the * operator to apply directly to head: (*head)->prev=temp; Also, don’t cast the return value of malloc as … Read more