JAVA

java treemap

import java.util.*;

// Declare the variable using the interface of the object for flexibility.
// Non-primative data types only.
Map<Integer, String> mambo = new TreeMap<Integer, String>();

mambo.put(key, value);
// TreeMap will be sorted by key.
// Work with any comparable object as a key.

mambo.put(1, "Monica");
mambo.put(2, "Erica");
mambo.put(3, "Rita");

Implementation of TreeMap Class in Java map

// Java Program to Illustrate TreeMap Class

// Importing required classes
import java.util.*;

// Main class
public class Main {

	// Main driver method
	public static void main(String[] args)
	{

		// Creating an empty TreeMap
		Map<String, Integer> hashmap = new TreeMap<>();

		// Inserting entries in the Map
		// using put() method
		hashmap.put("Banana", 100);
		hashmap.put("Orange", 200);
		hashmap.put("Mango", 300);
		hashmap.put("Apple", 400);
		
		// Iterating over Map using for each loop
		for (Map.Entry<String, Integer> e : hashmap.entrySet())

			// Printing key-value pairs
			System.out.println(e.getKey() + " "+ e.getValue());
	}
}

Java treemap

import java.util.*;  
class Tree_Map{  
public static void main(String args[]){  
   TreeMap<Integer,String> map=new TreeMap<Integer,String>();    
      map.put(93,"Afghanistan");    
      map.put(213,"Algeria");    
      map.put(55,"Brazil");       
        
      for(Map.Entry mapTree:map.entrySet()){    
       System.out.println(mapTree.getKey()+" "+mapTree.getValue());    
      }    
}  
}

treemap java

TreeMap<Integer, String> x = new TreeMap<Integer, String>();    
tm.put(1, "Hello");

what is treemap

- TreeMap doesn't have null key and keys are sorted
 Can contain only unique keys and keys are sorted in ascending order.

treemap

>>> def treemap(lst):
...     for i in range(len(lst)):
...         if type(lst[i])==int:
...             lst[i]=lst[i]**2
...         elif type(lst[i])==list:
...             treemap(lst[i])
...     return lst
>>> lst = [1, 2, 3, [4, [5, 6], 7]]
>>> print(treemap(lst))
[1, 4, 9, [16, [25, 36], 49]]

treemap

def treemap(lst):
    cp = list()
    for element in lst:
        if isinstance(element, list):
            cp.append(treemap(element))
        else:
            cp.append(element**2)
    return cp

treemap in java

TreeSet: Can contain only unique values and it is sorted in ascending order
TreeMap: Can contain only unique keys and keys are sorted in ascending order.