Feedback

src/main/java/com/example/project/ArrayList.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class ArrayList<T> implements List<T> {
     private int maxsize;
@@ -54,4 +54,4 @@ public void remove() {
         else if (current == size)
             current = 0;
     }
-}
+}

src/main/java/com/example/project/ArrayQueue.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class ArrayQueue<T> implements Queue<T> {
     private int maxsize;
@@ -31,4 +31,4 @@ public T serve () {
         size--;
         return e;
     }
-}
+}

src/main/java/com/example/project/ArrayStack.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class ArrayStack<T> implements Stack<T> {
     private int maxsize;
@@ -23,4 +23,4 @@ public void push(T e){
     public T pop(){
         return nodes[top--];
     }
-}
+}

src/main/java/com/example/project/DLL.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class DLL<T> {
 	private DLLNode<T> head;
@@ -76,4 +76,4 @@ public void removeBetween(T e1, T e2) {
         // Example 3.1. Given the list: A ↔ B ↔ C ↔ D ↔ E ↔ F, removeBetween(’B’,
         // ’E’) results in: A ↔ B ↔ E ↔ F.
     }
-}
+}

src/main/java/com/example/project/DLLNode.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class DLLNode<T> {
 	public T data;
@@ -19,4 +19,4 @@ public DLLNode(T data, DLLNode<T> next, DLLNode<T> previous) {
         this.next = next;
         this.previous = previous;
     }
-}
+}

src/main/java/com/example/project/LinkedList.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class LinkedList<T> implements List<T>{
 	private Node<T> head;
@@ -63,4 +63,4 @@ public T mostFrequentElement() {
         // Example 1.1. Given the list l : A, B, C, B, C, D, E, mostFrequentElement() returns
         // B.
     }
-}
+}

src/main/java/com/example/project/LinkedPQ.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class LinkedPQ<T> {
     private int size;

src/main/java/com/example/project/LinkedQueue.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class LinkedQueue<T> implements Queue<T>{
     private Node<T> head, tail;
@@ -34,4 +34,4 @@ public T serve() {
             tail = null;
         return x;
     }
-}
+}

src/main/java/com/example/project/LinkedStack.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class LinkedStack<T> implements Stack<T> {
     private Node<T> top;
@@ -23,4 +23,4 @@ public T pop() {
         top = top.next;
         return e;
     }
-}
+}

src/main/java/com/example/project/List.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public interface List<T> {
     public void findFirst( );
@@ -10,4 +10,4 @@ public interface List<T> {
     public boolean full( );
     public boolean empty( );
     public boolean last( );
-}
+}

src/main/java/com/example/project/Node.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class Node<T> {
 	public T data;
@@ -15,4 +15,4 @@ public Node(T data, Node<T> next) {
         this.data = data;
         this.next = next;
     }
-}
+}

src/main/java/com/example/project/PQElement.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class PQElement<T> {
     public T data;

src/main/java/com/example/project/PQNode.java

@@ -1,4 +1,4 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class PQNode<T> {
     public T data;

src/main/java/com/example/project/QueueStackTester.java

@@ -1,31 +1,63 @@
-package com.example.project;
+package main.java.com.example.project;
 
 public class QueueStackTester {
     public static <T> void split(Queue<T> q, Queue<T> oq, Queue<T> eq)
-    {
-        throw new UnsupportedOperationException("Not supported yet.");
-        // Write the recursive static method split that splits a queue of n elements into two
-        // queues. The elements with odd orders (i.e. 1st, 3rd, 5th ...) should be put in the
-        // first queue and elements with even orders (i.e. 2nd, 4th, 6th ...) should be put in
-        // the second queue. The original queue should remain unchanged at the end of the
-        // method.
-        // Example. Given the queue (A, B, C, D, E), split results in oq (A, C, E), and eq(B, D).
+    {        
+        int indexCount = oq.length() + eq.length() ;
+
+        if (indexCount == q.length())
+        	return;
+
+        T e = q.serve();
+        if (indexCount%2 == 0) {
+        	if(!oq.full())
+        	   oq.enqueue(e);
+        }
+        else { 
+        	if(!eq.full())
+        	   eq.enqueue(e);
+        }	
+        q.enqueue(e);
+
+        split(q, oq, eq);
+
+
     }
     public static <T> void remove(LinkedPQ<T> pq, int p)
     {
-        throw new UnsupportedOperationException("Not supported yet.");
-        // Write a static method remove that removes every element in the priority queue
-        // having priority less than p.
-        // Example. Given pq: [A, 10], [D, 8], [B, 5], [E, 3], [C, 2] remove(pq, 5) results in
-        // pq: [A, 10], [D, 8], [B, 5].
+       if (pq.length() == 0)
+    	   return;
+
+       PQElement<T> e = null;
+       LinkedPQ<T> temp = new LinkedPQ<T>();
+
+        for(int i = pq.length(); i>0; i--) {
+            e = pq.serve();
+        	if(e.p >= p) {
+        	    temp.enqueue(e.data, e.p);
+        	}
+        }
+
+        if(temp.length() == 0)
+        	return;
+
+        for(int i = temp.length(); i>0; i--) {
+        	e = temp.serve();
+        	pq.enqueue(e.data, e.p);
+        }
     }
     public static <T> boolean search(Stack<T> st, T e)
     {
-        throw new UnsupportedOperationException("Not supported yet.");
-        // Write the recursive static method search that searches for an element e in a stack st
-        // and returns true if it’s found or false otherwise. st should not change at the end of
-        // the method. You are not allowed to use any auxiliary data structures.
-        // Example. Given the stack st (top-to-bottom): 5, 7, 5, 3, 2. search(st, 3) returns
-        // true while search(st, 1) returns false.
+        if (st.empty())
+        	return false;
+        boolean check = false;
+        T temp = st.pop();
+        if (temp.equals(e))
+        	check = true;
+        check = check || search(st, e);
+        st.push(temp);
+        return check;
+
+
     }
-}
+}

src/test/java/com/example/project/TestQueueStack.java

@@ -1,4 +1,5 @@
-package com.example.project;
+package test.java.com.example.project;
+import main.java.com.example.project.*;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;