data/train/rghvgrv/Simple-Programs/Data-Structure-and-Algorithms/Java/Linked/Reverse.java

class Reverse{
  static Node first, last, t;

  static class Node{
    int data;
    Node next;

    Node(int d){
      this.data = d;
      next = null;
    }
  }

  void create(int a[], int n){

    first = new Node(a[0]);
    last = first;


    for(int i=1; i<n; i++){
      t = new Node(a[i]);
      last.next = t;
      last = t;
    }
  }
void reverse(Node p){
    int i=0;
    int a[] = new int[5];

    Node q = p;
    while(q!=null){
      a[i] = q.data;
      q = q.next;
      i++;
    }
    q = p;
    i--;
    while(q!=null){
      q.data = a[i];
      q = q.next;
      i--;
    }

  }
void reverse1(Node p){
  Node q = null;
  Node r = null;

  while(p!=null){

    r = q;
    q = p;

    p = p.next;
    q.next = r;
  }

  first = q;
}

void rever(Node q, Node p){

  if(p!=null){
    rever(p,p.next);
    p.next = q;
  }
  else{
    first = q;
  }
}
  void Display(){

    Node p = first;
    while(p!=null){
      System.out.print(p.data+" ");
      p = p.next;
    }
  }

  
  public static void main(String[] args){
    Reverse l = new Reverse();

    int a[] = {1,2,3,4,5};
    int n =a.length;
    l.create(a,n);
    System.out.println();

    l.rever(null,l.first);
    l.Display();
  }
}