NavigableMap pollLastEntry() method in Java


The NavigableMap pollLastEntry() method remove and returns a key-value mapping associated with the greatest key in this map.

Let us first create a NavigableMap and add some elements to it −

NavigableMap<Integer, String> n = new TreeMap<Integer, String>();
n.put(5, "Tom");
n.put(9, "John");
n.put(14, "Jamie");
n.put(1, "Tim");
n.put(4, "Jackie");
n.put(15, "Kurt");
n.put(19, "Tiger");
n.put(24, "Jacob");

Now, use the following method −

n.pollLastEntry();

The following is an example to implement the pollLastEntry() method −

Example

 Live Demo

import java.util.*;
public class Demo {
   public static void main(String[] args) {
      NavigableMap<Integer, String> n = new TreeMap<Integer, String>();
      n.put(5, "Tom");
      n.put(9, "John");
      n.put(14, "Jamie");
      n.put(1, "Tim");
      n.put(4, "Jackie");
      n.put(15, "Kurt");
      n.put(19, "Tiger");
      n.put(24, "Jacob");
      System.out.println("NavigableMap elements...
"+n);       System.out.println("
Removed (last) key-value is "+n.pollLastEntry());       System.out.println("
Updated NavigableMap elements...
"+n);    } }

Output

NavigableMap elements...
{1=Tim, 4=Jackie, 5=Tom, 9=John, 14=Jamie, 15=Kurt, 19=Tiger, 24=Jacob}

Removed (last) key-value is 24=Jacob

Updated NavigableMap elements...
{1=Tim, 4=Jackie, 5=Tom, 9=John, 14=Jamie, 15=Kurt, 19=Tiger}

karthikeya Boyini
karthikeya Boyini

I love programming (: That's all I know

Updated on: 30-Jul-2019

45 Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements