{"id":5349,"date":"2021-09-28T09:01:52","date_gmt":"2021-09-28T09:01:52","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=5349"},"modified":"2022-03-10T19:19:06","modified_gmt":"2022-03-10T19:19:06","slug":"java-util-linkedlist-poll-pollfirst-polllast-with-examples-in-java","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/java-util-linkedlist-poll-pollfirst-polllast-with-examples-in-java\/","title":{"rendered":"Java.util.LinkedList.poll(), pollFirst(), pollLast() with examples in Java"},"content":{"rendered":"

\"\"<\/p>\n

Introduction<\/h3>\n

One of the most crucial data structures to learn while preparing for interviews is the linked list. In a coding interview, having a thorough understanding of Linked Lists might be a major benefit.<\/p>\n<\/p>\n

Poll is a method in Java’s Linked list class that enables Queue Based functioning<\/strong>. This function deletes the elements at the front of the container and returns it, and so it has a wide range of applications in day-to-day problems and competitive programming.<\/p>\n

There are 3 different variation of poll()<\/strong> function. We will discuss all of them in detail in this article.<\/p>\n

poll() Method<\/h3>\n

This method deletes the head of the list and returns it. <\/p>\n

Syntax:<\/strong> public E poll()<\/p>\n

Return Value:<\/strong> This function returns the first element (head)<\/strong> of the linked list if there are elements in the list, and if the list is empty, it returns null.<\/p>\n

We will simply call the list. poll() to use this method.<\/p>\n

Input:<\/strong> [1 , 2 , 3 ,4 ]<\/p>\n

    \n
  • After using list.poll() <\/li>\n<\/ul>\n

    Output:<\/strong> 1 is displayed, and the resultant list is [ 2, 3, 4 ]<\/strong>.<\/p>\n

    Explanation:<\/strong> As we can see, after using list.poll()<\/strong>, the head of the list is displayed and deleted from the list.<\/p>\n

    Code Implementation<\/h4>\n\t\t\t\t\t\t