trees in java

// java treeset example
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetExamples
{
   public static void main(String[] args)
   {
      TreeSet<String> ts = new TreeSet<String>();
      ts.add("red");
      ts.add("blue");
      ts.add("green");
      ts.add("red");
      Iterator<String> iterate = ts.iterator();
      while(iterate.hasNext())
      {
         System.out.println(iterate.next());
      }
   }
}

// class implementing specific comparator
import java.util.Comparator;
import java.util.TreeSet;
class ComparatorDemo implements Comparator<String>
{
   public int compare(String str1, String str2) 
   { 
      String strFirst; 
      String strSecond; 
      strFirst = str1; 
      strSecond = str2; 
      return strSecond.compareTo(strFirst); 
   }
}
public class TreeSetComparableExample 
{
   public static void main(String[] args) 
   {
      TreeSet<String> ts = new TreeSet<String>(new ComparatorDemo());   
      ts.add("Grapefruit");
      ts.add("Eggfruit"); 
      ts.add("Apple"); 
      ts.add("Mango"); 
      ts.add("Papaya"); 
      ts.add("42"); 
      System.out.println("TreeSet before using comparator: " + ts);
      System.out.println("Sorted in descending order: "); 
      for(String str : ts)
      {
         System.out.print(str + ", ");
      }
   }
}

// how to sort TreeSet in descending order in java
import java.util.TreeSet;
public class TreeSetExample 
{
   public static void main(String[] args) 
   {
      TreeSet<Object> number = new TreeSet<Object>(); 
      number.add(1); 
      number.add(24); 
      number.add(15); 
      number.add(6); 
      number.add(9); 
      number.add(2);
      // reverse order using descendingSet()
      TreeSet<Object> reverseOrder = (TreeSet<Object>)number.descendingSet();
      // printing set 
      System.out.println("Without using descendingSet() method: " + number); 
      System.out.println("Using descendingSet() method: " + reverseOrder);
   }
}

package MyPackage;
  
public class Tree { 
    static class Node {    
    int value; 
        Node left, right; 
          
        Node(int value){ 
            this.value = value; 
            left = null; 
            right = null; 
        } 
    } 
       
    public void insert(Node node, int value) {
        if (value < node.value) { if (node.left != null) { insert(node.left, value); } else { System.out.println(" Inserted " + value + " to left of " + node.value); node.left = new Node(value); } } else if (value > node.value) {
          if (node.right != null) {
            insert(node.right, value);
          } else {
            System.out.println("  Inserted " + value + " to right of "
                + node.value);
            node.right = new Node(value);
          }
        }
      }
     public void traverseInOrder(Node node) {
        if (node != null) {
            traverseInOrder(node.left);
            System.out.print(" " + node.value);
            traverseInOrder(node.right);
        }
     }
     
     public static void main(String args[]) 
    { 
    Tree tree = new Tree();
                Node root = new Node(5);
                System.out.println("Binary Tree Example");
                System.out.println("Building tree with root value " + root.value);
                tree.insert(root, 2);
                tree.insert(root, 4);
                tree.insert(root, 8);
                tree.insert(root, 6);
                tree.insert(root, 7);
                tree.insert(root, 3);
                tree.insert(root, 9);
                System.out.println("Traversing tree in order");
                tree.traverseLevelOrder();
                
              }
}

import java.util.*;

// Declare the variable using the interface of the object for flexibility.
// Non-primative data types only.
Set<String> movies = new TreeSet<String>();

movies.add(E);
// TreeSet will be sorted by element.
// Work with any comparable object.

movies.add("The Shining");
movies.add("Dawn of the Dead");
movies.add("Zombieland");