Data Structures Final- Big O's!!!

SkipList boolean add (E e)

O(log n)

SkipList boolean addAll(Collection c)

O(n log n)

SkipList int indexOf(Object O)

O(n)

SkipList boolean contains(Object O)

O(log n)

SkipList boolean containsAll(Collection c)

O(n log n)

SkipList boolean equals (Object o)

O(n)

SkipList boolean isEmpty()

O(1)

SkipList E get(int index)

O(n)

SkipList E getQuantile(double quantile)

O(n)

SkipList E remove(int index)

O(n)

SkipList boolean remove(object o)

O(log n)

SkipList boolean removeAll(collection c)

O(n log n)

SkipList int hashCode()

O(n)

SkipList Object[] toArray()

O(n)