Recursive and non-Recursive Algorithms for chain table Inversion

Note: The linked list does not have a pseudo header. The first element is the data element.

The node is defined as follows:

Struct Node
{
Int data;
Node * next;
};

 

Non-recursive algorithms:

1 node * reverse (node * head)
2 {
3 if (Head = NULL) return NULL;
4 node * pre = head;
5 Node * P = pre-> next;
6 node * q = NULL;
7 while (P! = NULL)
8 {
9 q = p-> next;
10 p-> next = pre;
11 if (pre = head) // reverse to prevent Loops
12 pre-> next = NULL;
13 pre = P;
14 p = Q;
15}
16 return pre;
17}

 

Recursive Algorithm:

Node * reverse (node * List, node * pre = NULL) {If (list = NULL) return list; node * Next = List-> next; list-> next = pre; return next = NULL? List: reverse (next, list );}