Insert alphabetically linked list C

Im trying to write an insertion method for a doubly linked list where as i'm placing the node into the list it is being inserted in alphabetical order. This idea is I will traverse through the list with a curnode and if the newNode comes before the curnode, I will simply place the newNode before the curnode. The code I have written so far works for inserting 1 node into the list, but i'm having problems with the second part that requires checking the order and placing before. How should I change the program to make it work properly? With the code I have now only 1 element [head] will be inserted.

void insert[String x]{ node curnode = head; node newNode = new node[x]; //list is empty so insert as normal - [works fine] if [head == null]{ head = newNode; head.prev = null; head.next = null; tail = newNode; } //Now insert node with respect to alphabetical order - [problem area] else { // while the list isn't empty while [curnode != null]{ // if newNode alphabetically comes before the curnode then place before if [curnode.data.compareTo[newNode.data] > 0]{ node temp = curnode.prev; curnode.prev = newNode; newNode.next = curnode; newNode.prev = temp; break; } } } }

There are a few things missing with your implementation. Compare it with this working solution:

void insert[String x]{ node curnode = head; node lastnode = null; node newNode = new node[x]; //list is empty so insert as normal - [works fine] if [head == null]{ head = newNode; head.prev = null; head.next = null; tail = newNode; } //Now insert node with respect to alphabetical order - [problem area] else { // while the list isn't empty while [curnode != null]{ // if newNode alphabetically comes before the curnode then place before if [curnode.data.compareTo[newNode.data] > 0]{ node temp = curnode.prev; curnode.prev = newNode; newNode.next = curnode; newNode.prev = temp; if[temp != null] { temp.next = newNode; } else { // If newnode gets inserted in the head head = newNode; } break; } lastnode = curnode; curnode = curnode.next; } if [curnode == null] { // insert to the last lastnode.next = newNode; newNode.prev = lastnode; tail = newNode; } } }

Tags: Java / Algorithm / Sorting

Implementing a SelectionSort capable of handling array list, linked list, and doubly linked list in java How do I insert a new node before first node of a doubly-linked list? Doubly Linked List Java Remove method does not work for any node besides head node How Can I Print The Previous Node and Next Node for a Doubly Linked List? delete node after specified node in doubly linked list. [recursively] Having trouble inserting into a doubly linked, double ended list with Java Copying a linked list node and inserting it in the middle of a linked list How to output the correct linked list when Inserting a node at a specific position in a singly linked list recursively? How to insert an "info" node into a linked-list, numerically or alphabetically, without using a sorting method? Singly linked list to doubly linked list

Video liên quan