JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Checkout for Promo Codes

Program: How to create a TreeSet with a List?


Description:

Below example shows how to create TreeSet with other collection. By passing another collection to the TreeSet constructor, you can copy entire collections elements to the TreeSet.


Code:
package com.java2novice.treeset;

import java.util.ArrayList;
import java.util.List;
import java.util.TreeSet;

public class MySetWithCollection {
	public static void main(String a[]){
		List<String> li = new ArrayList<String>();
		li.add("one");
		li.add("two");
		li.add("three");
		li.add("four");
		System.out.println("List: "+li);
		//create a treeset with the list
		TreeSet<String> myset = new TreeSet<String>(li);
		System.out.println("Set: "+myset);
	}
}

Output:
List: [one, two, three, four]
Set: [four, one, three, two]
<< Previous Program | Next Program >>

List Of All TreeSet Sample Programs:

  1. Basic TreeSet Operations.
  2. How to create a TreeSet with a List?
  3. How to read objects from TreeSet using using Iterator?
  4. Write a program to remove duplicate entries from an array.
  5. Write a program to find duplicate value from an array.
  6. How to create a TreeSet with comparator?
  7. Create TreeSet with comparator by user define objects.
  8. How to sort a TreeSet with user defined objects?
  9. How to get subset from sorted set?
  10. How to get least value element from a set?
  11. How to get highest value element from a set?
  12. How to avoid duplicate user defined objects in TreeSet?
Knowledge Centre
When to use LinkedList or ArrayList?
Accessing elements are faster with ArrayList, because it is index based. But accessing is difficult with LinkedList. It is slow access. This is to access any element, you need to navigate through the elements one by one. But insertion and deletion is much faster with LinkedList, because if you know the node, just change the pointers before or after nodes. Insertion and deletion is slow with ArrayList, this is because, during these operations ArrayList need to adjust the indexes according to deletion or insetion if you are performing on middle indexes. Means, an ArrayList having 10 elements, if you are inserting at index 5, then you need to shift the indexes above 5 to one more.
Famous Quotations
The pessimist complains about the wind; the optimist expects it to change; the realist adjusts the sails.
-- William Arthur Ward

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2020 by Nataraja Gootooru. All Rights Reserved.