LL2 codes

anmolpant · anmolpant · commit 70a8ba3d2c43 · 2021-01-26T19:12:41.000+05:30
diff --git a/Data Structures in Java/Level 2/Linked List 2/reverseLL_Recursive/Node.java b/Data Structures in Java/Level 2/Linked List 2/reverseLL_Recursive/Node.java
@@ -0,0 +1,12 @@
+
+public class Node<T> {
+	
+	T data;
+	Node<T> next;
+	
+	Node(T data){
+		this.data = data;
+		next = null;
+	}
+	
+}
diff --git a/Data Structures in Java/Level 2/Linked List 2/reverseLL_Recursive/ReverseLL.java b/Data Structures in Java/Level 2/Linked List 2/reverseLL_Recursive/ReverseLL.java
@@ -0,0 +1,66 @@
+import java.util.Scanner;
+
+public class ReverseLL {
+
+	
+	public static Node<Integer> reverseR(Node<Integer> head){
+		if(head == null || head.next == null){
+			return head;
+		}
+		
+		Node<Integer> finalHead = reverseR(head.next);
+		Node<Integer> temp = finalHead;
+		while(temp.next != null){
+			temp = temp.next;
+		}
+		temp.next = head;
+		head.next = null;
+		return finalHead;
+	}
+	
+	public static Node<Integer> takeInput()
+
+	{
+		Node<Integer> head = null, tail = null;
+		Scanner s = new Scanner(System.in);
+		int data = s.nextInt();
+				
+		while(data != -1){
+			Node<Integer> newNode = new Node<Integer>(data);
+			if(head == null){
+				head = newNode;
+				tail = newNode;
+			}else{
+//				Node<Integer> temp = head;
+//				while(temp.next != null){
+//					temp = temp.next;
+//				}
+//				temp.next = newNode;
+				tail.next = newNode;
+				tail = newNode; // tail = tail.next
+			}
+			data = s.nextInt();
+		}
+		return head;
+	}
+
+	public static void print(Node<Integer> head){
+		
+		while(head != null){
+			System.out.print(head.data +" ");
+			head = head.next;
+		}
+		System.out.println();
+
+	}
+
+	
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Node<Integer> head = takeInput();
+		head = reverseR(head);
+		print(head);
+		
+	}
+
+}
