treeset

In my code, Java TreeSet iteration is the dominant time factor. In looking at the system I believe that it is O(n) complexity. Can anyone verify this? I am thinking that by providing links backward from child node to parent node I could improve the performance. TreeSet iteration is of course O(n), as can be expect from any sensible tree-walking algorithm. I am thinking that by providing links backward from child node to parent node I could improve the performance. TreeMap (which TreeSet is based on) already has such parent references. This is the method it all boils down to: private Entry<K,V>

I'm wondering what is the time complexity of size() for portion view of TreeSet. Let say I'm adding random numbers to set (and I do not care about duplicities): final TreeSet<Integer> tree = new TreeSet<Integer>(); final Random r = new Random(); final int N = 1000; for ( int i = 0; i < N; i++ ) { tree.add( r.nextInt() ); } and now I'm wodering what is complexity for size() calls as: final int M = 100; for ( int i = 0; i < M; i++ ) { final int f = r.nextInt(); final int t = r.nextInt(); System.out.println( tree.headSet( t ).size() ); System.out.println( tree.tailSet( f ).size() ); if ( f > t )

I am trying to merge multiple sorted lists into one TreeSet.. And then I am thinking to apply Binary Search algorithm on that TreeSet to retrieve the element in O(log n) time complexity.. Below is my code in which I am passing List of Lists in in one of my method and combining them into TreeSet to avoid duplicacy... All the lists inside inputs are sorted - private TreeSet<Integer> tree = new TreeSet<Integer>(); public void mergeMultipleLists(final List<List<Integer>> inputs) { tree = new TreeSet<Integer>(); for (List<Integer> input : inputs) { for(Integer ii : input) { tree.add(ii); } } }

I'm writing a contact book application in Java using the swing and awt libraries. The Application consists of a JList which uses a TreeSet as an abstractListModel. The TreeSet is for a class called Contact, which has private comparator class that sorts contacts based on their first name. the private boolean equals(Object o) method returns true if the Contact has the same mobileNumber as that of O (after casting, of course). I want to add a search functionality into this application. I've made a search JTextField and added a keyListener and what I want to do is that after each key is pressed,

In Java’s documentation for its class TreeSet one of the constructors is shown to have the following header: TreeSet(Comparator<? super E> c) Can someone help explain why there is a constructor for TreeSet which takes a comparator object as its argument? I have no clue why this is done. The elements in a TreeSet are kept sorted. If you use a constructor that has no Comparator, the natural ordering of the element class (defined by the implementation of Comparable ) would be used to sort the elements of the TreeSet. If you want a different ordering, you supply a Comparator in the constructor.

I have created a Student class like this: public class Student implements Comparable<Student> { private String firstName; private String lastName; public Student(String firstName, String lastName) { this.firstName = firstName; this.lastName = lastName; } // Getters & Setters follow here... @Override public int compareTo(Student student) { int hash = this.firstName.compareTo(student.firstName); return hash; } @Override public String toString() { return "Student [firstName=" + firstName + ", lastName=" + lastName + "]"; } } This is my test class where I just add elements to my TreeSet: public