[C++ 04.11] linkedlist 역순으로 정렬

void rever(Node **head) {            Node *curNode,*preNode,*tmp;            preNode=NULL;            curNode=*head;            if(curNode)            {                        while(curNode->next)                        {                                    tmp=curNode->next;                                    curNode->next=preNode;                                    preNode=curNode;                                    curNode=tmp;                         }                         curNode->next=preNode;                         *head=curNode;            } }

리스트의 주소값만 바꿔서 역순으로 정렬하는 방법!!