Compile error in drop out stack program

Question

I have a compile error "Cannot find symbol" Symbol: constructor Node(E, dropOutStack.Node<E> on line 20
line 20 : topStackRef = new Node<E>(obj, topStackRef);
import java.util.*;
          public class dropOutStack<E>  {
             private Node<E> topStackRef = null; //reference to first stack node
       //Node class     
          class Node<E> {
                private E data; //data value
          private Node<E> next = null; //link to next node
          private Node<E> prev = null; //link to previous node
          private Node(E dataItem) {
               data = dataItem;
             public E push(E obj) {
                    topStackRef = new Node<E>(obj, topStackRef);
               return obj;
           public E pop() {
                     if (empty()) {
                    throw new EmptyStackException();
               else {
                    E result = toStackRef.data;
                    topStackRef = topStackRef.next;
                    return result;;
           public E peek() {
                     if (empty()) {
                    throw new EmptyStackException();
               else {
                    return topStackRef.data;
           public boolean empty() {
                     return topStackRef == null;
           public static void main(String [] args) {
           Node<String> itemStack = new Node<String>();
           String[] items = {"Item1", "Item2", "Item3", "Item4", "Item5"};
           for (int i = 0; i < 5; i++) {
                int itemNumber = nextInt(i);
               itemStack.push(items[itemNumber]);     
           System.out.println(itemStack);
       

Answer 1

Anyways. I need help with the logic. As far as I
know, DropOut stacks cannot return something that has
been poped or removed. if the operation (performed n
times) is n+1 times.No empty stack can be popped, if that's what you're saying.
If you examine your assignment, it describes special behavior for drop-out stacks during the push method. It says that stacks are made with a given size, and that when the stack is full, subsequent pushes cause the least-recently-pushed element to drop out.
Your code doesn't do that. It does some futzing during pop whose purpose is unclear to me.