PreCourse 1 Submission

StackAsLinkedList.java → Exercise_2.java

@@ -8,11 +8,11 @@ isEmpty     O(1)
 pop()       O(1)
 peek()      O(1)
 */
-public class StackAsLinkedList {
+public class Exercise_2 {
 
     StackNode root;
 
-    StackAsLinkedList(){
+    Exercise_2(){
         root=null;
     }
 
@@ -78,7 +78,7 @@ public int peek()
     public static void main(String[] args)
     {
 
-        StackAsLinkedList sll = new StackAsLinkedList();
+        Exercise_2 sll = new Exercise_2();
 
         sll.push(10);
         sll.push(20);

LinkedList.java → Exercise_3.java

@@ -9,7 +9,7 @@
 insert     O(n) n is the number of elements in the linkedlist to be traversed
 printList  O(n) n is the number of elements in the linkedlist
 */
-public class LinkedList {
+public class Exercise_3 {
 
     Node head; // head of list
 
@@ -31,7 +31,7 @@ static class Node {
     }
 
     // Method to insert a new node
-    public static LinkedList insert(LinkedList list, int data)
+    public static Exercise_3 insert(Exercise_3 list, int data)
     {
         // Create a new node with given data
         Node newNode=new Node(data);
@@ -59,7 +59,7 @@ public static LinkedList insert(LinkedList list, int data)
     }
 
     // Method to print the LinkedList.
-    public static void printList(LinkedList list)
+    public static void printList(Exercise_3 list)
     {
         // Traverse through the LinkedList
         Node node=list.head;
@@ -75,7 +75,7 @@ public static void printList(LinkedList list)
     public static void main(String[] args)
     {
         /* Start with the empty list. */
-        LinkedList list = new LinkedList();
+        Exercise_3 list = new Exercise_3();
 
         //
         // ******INSERTION******