package name changed and added question on linked list

Author: muskanmi

LinkedList/Middle.java

@@ -0,0 +1,39 @@
+package LinkedList;
+import java.util.ArrayList;
+
+class Node {
+    public int data;
+    public Node next;
+}
+  
+class NodeOperation {
+  // Function to add a new node
+    public void pushNode(Node[] headRef, int dataVal) {
+      // Allocate node
+        Node newNode = new Node();
+      // Put in the data
+        newNode.data = dataVal;
+      // Link the old list of the new node
+        newNode.next = headRef[0];
+      // move the head to point to the new node
+        headRef[0] = newNode;
+    }
+}
+
+public class Middle {
+    public static void main(String[] args) {
+        Node[] head = new Node[1];
+        NodeOperation temp = new NodeOperation();
+        for (int i = 5; i > 0; i--) {
+            temp.pushNode(head, i);
+        }
+        ArrayList<Integer> v = new ArrayList<Integer>();
+        Node curr = head[0];
+        while (curr != null) {
+            v.add(curr.data);
+            curr = curr.next;
+        }
+        System.out.print("Middle Value Of Linked List is : ");
+        System.out.println(v.get(v.size() / 2));
+    }
+}

recursion/Digits_sum.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Digits_sum {
     int fun(int n) {

recursion/Hanoi.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Hanoi {
     void TOH(int n, char A, char B, char C) {

recursion/Josephus.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Josephus {
     int jos(int n, int k) {

recursion/Lucky.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Lucky {
     boolean isLucky(int n){

recursion/One.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class One {
     void fun(int n) {

recursion/Output.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Output {
     // void fun(int n) {

recursion/Outputs.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Outputs {
     // int fun(int n) {

recursion/Palindrome.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Palindrome {
     boolean isPlaindrome(String str) {

recursion/Rope.java

@@ -1,4 +1,4 @@
-package recursion;
+package Recursion;
 
 public class Rope {
     int maxPieces(int n, int a, int b, int c){