Thread: how to reverse items in linked list?

here is my code

Code:

struct list
{
	NodeType* listData;
	int length;
};

 UnsortedType* CreateList(void)
{
	UnsortedType *list = (UnsortedType *) malloc(sizeof(UnsortedType));
	list->listData = NULL;
	list->length = 0;
	return list;
 }


void InsertItem(UnsortedType *list, int key, char* name)
{
	NodeType* current; /* traveling pointer */

	current = (NodeType*) malloc(sizeof(NodeType));
	current->key = key;
	strcpy(current->name, name);
	current->next = list->listData;
	list->listData = current;
	ist->length++;
}

i am wondering how i can permanently reverse the orders of the items in the list.
void reverse(NODE* list)

Did you try searching the web? Google turned up dozens of great sites with examples. The forum should be your last resort, and even then you should make an attempt to do it before asking for help.

Did you test it? Did it reverse the list as you would expect? If not, what did it do (or not do) incorrectly?

The only way I'm aware of that really works is to rebuild the list from back to front. If you have a function that inserts a node before another given node, call it such that everything after the head is added to the new list before the head node.

Walk the list beginning to end, changing each forward-link to point to the previous element you just came from.