CodesJava

Easy learning with example program codes

how to search a value in treemap in java?


TreeMap

TreeMap extends AbstractMap class and implements the NavigableMap interface. It contains the elements in key-value pair form. It maintains ascending order for its elements. It not allowed duplicate key.

Note: A TreeMap can have only one null key but can have multiple null values.

We can use containsValue() method to search a value in treemap in java.

containsValue(Object v): Returns true if this map contains specified value otherwise returns false.
Syntax: public boolean containsValue(Object v)

Example

package com.codesjava;
 
import java.util.TreeMap;
 
public class Test {
  public static void main(String args[]){
	//Create TreeMap object.
	TreeMap<Integer, String> treeMap = new TreeMap<Integer, String>();
 
	//Add objects to the TreeMap.
	treeMap.put(4, "Roxy");
	treeMap.put(2, "Sunil");
	treeMap.put(5, "Sandy");
	treeMap.put(1, "Munish");
	treeMap.put(3, "Pardeep");
 
	//Print the TreeMap object.
	System.out.println("TreeMap elements:");
	System.out.println(treeMap);
 
	if(treeMap.containsValue("Roxy")){
            System.out.println("The TreeMap contains Value Roxy");
        } else {
            System.out.println("The TreeMap does not contains Value Roxy");
        }
  }
}

Output

TreeMap elements:
{1=Munish, 2=Sunil, 3=Pardeep, 4=Roxy, 5=Sandy}
TreeMap elements using iterator:
Key: 1, Value: Munish
Key: 2, Value: Sunil
Key: 3, Value: Pardeep
Key: 4, Value: Roxy
Key: 5, Value: Sandy
Sign Up/ Sign In
Ask a Question


Industrial Training

We offers Placement Oriented Training on Java, Spring, JSF, Hibernate, PHP, AngularJS, Angular 4, PLSQL, Oracle BI Publisher etc. We also provides Online training, please mail us at hr@codesjava.com.

Development

We also provides the Development services for Website Development , Java Development, PHP Development, Android App Development etc. You can contact us on hr@codesjava.com.

Copyright © 2018 CodesJava DMCA.com Protection Status SiteMap Reference: Java Wiki