//kelly briceno
//stacks and queues assignemnt
public class MainSort {

 public static void main(String[] args) {
  //created linked list 
  System.out.println("Linked List");
  LinkedList list = new LinkedList();
  //adding items to linked list
  list.add(1);
  list.add(2);
  list.add(3);
  list.add(4);
  
 //calling print method
  list.print();
  //calling remove method
  list.remove(3);
  //calling print method
  list.print();
  //creating new stack
  System.out.println("\nStack");
  Stack stack = new Stack();
  //creating items in stack
  stack.push(1);
  stack.push(2);
  stack.push(3);
  stack.push(4);
  //call for print method
  stack.print();
  //call for pop method
  stack.pop();
  
  stack.print();
  stack.peek();
//creating new queue
  System.out.println("\nQueue");
  Queue queue = new Queue();
  //inseting items in queue
  queue.enqueue(1);
  queue.enqueue(2);
  queue.enqueue(3);
  queue.enqueue(4);
  
  queue.print();
  
  queue.dequeue();
  //calling print method 
  queue.print();
  queue.peek();
  
//stack 2 stack
  //creating new stack 
  Stack stackA = new Stack(); //creating new stack
    stackA = stack2stack(stack);
    stack.print();
    stack.print();
    stack.push(3);
    stack.push(4);
    stack.push(5);
    stackA = stack2stack(stack);
    stackA.print();
    
     Stack emptystack = new Stack();
    stackA = stack2stack(emptystack);
    stackA.print();
  }
 //
  //method to transfer items from one stack to another
  public static Stack stack2stack(Stack startStack) {
    Stack endstack = new Stack();
    while (!startStack.isEmpty()) {
    
    }
    return(endstack);
  } 
  
  
  
  
 }

@@ -432,1197 +432,13 @@
 );%0A 
- //creating new stack%0A  System.out.println(%22%5CnStack%22);%0A  Stack stack = new Stack();%0A  //creating items in stack%0A  stack.push(1);%0A  stack.push(2);%0A  stack.push(3);%0A  stack.push(4);%0A  //call for print method%0A  stack.print();%0A  //call for pop method%0A  stack.pop();%0A  %0A  stack.print();%0A  stack.peek();%0A//creating new queue%0A  System.out.println(%22%5CnQueue%22);%0A  Queue queue = new Queue();%0A  //inseting items in queue%0A  queue.enqueue(1);%0A  queue.enqueue(2);%0A  queue.enqueue(3);%0A  queue.enqueue(4);%0A  %0A  queue.print();%0A  %0A  queue.dequeue();%0A  //calling print method %0A  queue.print();%0A  queue.peek();%0A  %0A//stack 2 stack%0A  //creating new stack %0A  Stack stackA = new Stack(); //creating new stack%0A    stackA = stack2stack(stack);%0A    stack.print();%0A    stack.print();%0A    stack.push(3);%0A    stack.push(4);%0A    stack.push(5);%0A    stackA = stack2stack(stack);%0A    stackA.print();%0A    %0A     Stack emptystack = new Stack();%0A    stackA = stack2stack(emptystack);%0A    stackA.print();%0A  %7D%0A //%0A  //method to transfer items from one stack to another%0A  public static Stack stack2stack(Stack startStack) %7B%0A    Stack endstack = new Stack();%0A    while (!startStack.isEmpty()) %7B%0A    %0A    %7D%0A    return(endstack);%0A  %7D 
+%0A%0A  %0A
 %0A  %0A

removed stacks and queues because its unneccessary