reverseDoubleLinkedList.java

  class Node {
     int data;
     Node next;
     Node prev;
  }

Node Reverse(Node head) {
    if(head == null) return null;
    Node  temp;
    Node curr = head;
    Node prev = null;
    while(curr != null){
        temp   = curr.next;
        curr.next = curr.prev;
        curr.prev = temp;
        prev = curr;
        curr = temp;
    }
    return prev;

}