Easy learning with example program codes

How to get highest value element from a set?


TreeSet extends AbstractSet and implements the NavigableSet interface. It maintains ascending order for its elements i.e. elements will be in sorted form.


package com.codesjava;
import java.util.Comparator;
import java.util.TreeSet;
class Employee{    
    private String name;
    private int salary;
    public Employee(String name, int salary){ = name;
        this.salary = salary;
    public String getName() {
        return name;
    public void setName(String name) { = name;
    public int getSalary() {
        return salary;
    public void setSalary(int salary) {
        this.salary = salary;
    public String toString(){
        return "Name: "", Salary: "+this.salary;
class SalaryComp implements Comparator<Employee>{        
    public int compare(Employee e1, Employee e2) {
        if(e1.getSalary() > e2.getSalary()){
            return 1;
        } else {
            return -1;
public class Test {
    public static void main(String args[]){
    	TreeSet<Employee> treeSet = new TreeSet<Employee>(new SalaryComp());
    	treeSet.add(new Employee("Jai",50000));
    	treeSet.add(new Employee("Mahesh",80000));
    	treeSet.add(new Employee("Vishal",60000));
    	treeSet.add(new Employee("Hemant",64000));
        System.out.println("Highest salary emp: "+treeSet.last());


Highest salary emp: Name: Mahesh, Salary: 80000

Copyright © 2018 CodesJava Protection Status SiteMap