w3resource

Java: Convert a hash set to a tree set


8. Convert HashSet to TreeSet

Write a Java program to convert a hash set to a tree set.

Sample Solution:

Java Code:

import java.util.*;
  public class Exercise8 {
  public static void main(String[] args) {
         // Create a empty hash set
     HashSet<String> h_set = new HashSet<String>();
   // use add() method to add values in the hash set
          h_set.add("Red");
          h_set.add("Green");
          h_set.add("Black");
          h_set.add("White");
          h_set.add("Pink");
          h_set.add("Yellow");
      System.out.println("Original Hash Set: " + h_set);
    
     // Creat a TreeSet of HashSet elements
     Set<String> tree_set = new TreeSet<String>(h_set);
 
     // Display TreeSet elements
     System.out.println("TreeSet elements: ");
     for(String element : tree_set){
        System.out.println(element);
     }
  }
}

Sample Output:

Original Hash Set: [Red, White, Pink, Yellow, Black, Green]            
TreeSet elements:                                                      
Black                                                                  
Green                                                                  
Pink                                                                   
Red                                                                    
White                                                                  
Yellow

Pictorial Presentation:

Java Collection, ArrayList Exercises: Convert a hash set to a tree set

Flowchart:

Flowchart: Convert a hash set to a tree set.

For more Practice: Solve these Related Problems:

  • Write a Java program to convert a HashSet to a TreeSet and then print the elements in natural sorted order.
  • Write a Java program to convert a HashSet to a TreeSet and verify that adding a new element maintains the sorted order.
  • Write a Java program to compare the performance of converting a large HashSet to a TreeSet using different methods.
  • Write a Java program to convert a HashSet to a TreeSet and then remove elements that do not meet a specified condition.

Go to:


PREV : Convert HashSet to Array.
NEXT : Find Elements Less Than 7 in TreeSet.

Java Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.