feat t:Added Stack Implementation Using LinkedList

Author: tarandeepsingh-wd

src/main/java/com/thealgorithms/stacks/StackUsingLinkedList.java

@@ -56,34 +56,3 @@ public boolean isEmpty() {
         return size == 0;
     }
 }
-class demo{
-    public static void main(String[] args) {
-        StackUsingLinkedList<Integer> stack = new StackUsingLinkedList<>();
-
-        System.out.println("Is stack empty? " + stack.isEmpty());
-        System.out.println("Initial size: " + stack.size());
-
-
-        stack.push(10);
-        stack.push(20);
-        stack.push(30);
-
-        System.out.println("After pushes:");
-        System.out.println("Top element: " + stack.peek()); // 30
-        System.out.println("Size: " + stack.size());        // 3
-
-        // Pop elements
-        System.out.println("Popped: " + stack.pop()); // 30
-        System.out.println("Popped: " + stack.pop()); // 20
-
-        System.out.println("After pops:");
-        System.out.println("Top element: " + stack.peek()); // 10
-        System.out.println("Size: " + stack.size());        // 1
-
-        System.out.println("Is stack empty? " + stack.isEmpty());
-
-
-        stack.pop();
-        System.out.println("Is stack empty after final pop? " + stack.isEmpty());
-    }
-}