Object function ( ) { if ( head == null ) { throw new QueueEmptyException ( ) ; } else { Object loc0 = head . item ; head = head . next ; size -- ; if ( size == 0 ) { tail = null ; } return loc0 ; } }
dequeue removes and returns the object at the front of the queue . concode_field_sep SListNode head concode_elem_sep int size concode_elem_sep SListNode tail concode_field_sep void enqueue concode_elem_sep Object nth concode_elem_sep int size concode_elem_sep boolean isEmpty concode_elem_sep String toString concode_elem_sep Object front concode_elem_sep void append