reverse ll (iterative) coding ninjas.cpp

****************************************************************
 
    Following is the class structure of the Node class:

        class Node
        {
        public:
	        int data;
	        Node *next;
	        Node(int data)
	        {
		        this->data = data;
		        this->next = NULL;
	        }
        };

*****************************************************************/

Node *reverseLinkedList(Node *head) {
    Node *prev = NULL;
	Node *current =head;
	Node *next = NULL;
	while(current != NULL){
		 next = current->next; // Store the next node
        current->next = prev; // Reverse the current node's pointer
        prev = current;       // Move prev to current
        current = next;
	}
	return prev;
}