In addition, when adding to the back you weren't checking if head was null, so when adding to the back, you only updated the tail end, and ended up with two separate lists as a result. So when going over the list, the next to last node would still be pointing to NULL. You're forgetting to set the old tails next pointer to the new tail. My output should display 10 20 30 40 50 60 70 80īut instead my displayForward displays the items I added to the Front and my displayBackward displays the items I added to the back. List.displayForward() //10 20 30 8 (the 8 value is the count/size i'm keeping track of) //////////////////My Test Code://///////////////// int main() MadPhysicist 'It deque behaves like a linked list in almost every way, even if the name is different.' it is either wrong or meaningless: it is wrong because linked lists may provide different guarantees for time complexities e.g. display items in linked list from front to back Here, in this post we will learn about stack implementation using linked list in C language.
PUSH FUNCTION DOUBLY LINKED LIST STACK HOW TO
Int removeBack() //remove item from back of linked list In my previous post, I covered how to implement stack data structure using array in C language. Int removeFront() //remove item from front of linked list Void addBack(int) //add item to back of linked list Void addFront(int) //add item to front of linked list Void displayBackward() //display items from back to front
Void displayForward() //display items from front to back I posted what my output is and what it showed be at the bottom of this post.ĭoubleLinkedList() //default constructor In the push () function, we push the element into the stack, and make it the top. It seems my addFront and display functions are working but my addBack is probably where my error is. Pushing a node to a doubly-linked list is similar to pushing a node to a linked list, but extra work is required to handle the pointer to the previous node. I came across an error in my output I’m trying to understand. I’m working on a few pieces of code: one function to add an item to the front, another to add an item to the back, and forward and reverse display methods that output the linked list from front to back and back to front, respectively.
0 kommentar(er)
