Queue (storage structure double-ended linked list)--java implementation

1 /*queues implemented with linked lists-using double-ended lists2 * NOTE: null pointer error must be reference not pointing to object3  * */4  Public classMylinkedqueue {5     Privatemyfirstandlastlinkedlist list;6     Private intitems;7 8      PublicMylinkedqueue () {9List =Newmyfirstandlastlinkedlist ();TenItems = 0; One     } A      -      Public BooleanIsEmpty () { -         returnList.isEmpty (); the     } -      -      Public voidInsertintkey) { - list.insertlast (key); +items++; -     } +      A      PublicLink Remove () { atitems--; -         returnList.deletefirst (); -     } -      -      Public voidDisplayqueue () { -System.out.println ("queue--front--to--rear"); in list.displaylinkedlist (); -     } to      +      Public intsize () { -         returnitems; the     } *  $      Public Static voidMain (string[] args) {Panax NotoginsengMylinkedqueue queue =Newmylinkedqueue (); -          for(inti = 0; I < 10; i++){ theQueue.insert (i);//Tail Insertion +         } A queue.displayqueue (); theQueue.remove ();//Remove Head + queue.displayqueue (); -     } $}

Queue (storage structure double-ended linked list)--java implementation