Reverse a linked list using recursion

Question

Vijay H · Accepted Answer

Node reverse(Node node) 
    { 
        Node prev = null; 
        Node current = node; 
        Node next = null; 
        while (current != null) { 
            next = current.next; 
            current.next = prev; 
            prev = current; 
            current = next; 
        } 
        node = prev; 
        return node; 
    }

Vijay H · Answer

Above one for iterative .

below is recursive :

 public Node reverse(Node head){

        //base condition
        if(head == null || head.next == null)
            return head;

        Node temp = reverse(head.next);
        head.next.next = head;
        head.next = null;

        return temp;
    }

Perfios Software

Question d’entretien chez Perfios Software

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois