132 easy

What is List in Java

• ADT

• Interface

• Class

• Abstract Class

What classes implement List

• ArrayList

• LinkedList

• Stack

• Array

Average Case Time Complexity of Access (Array)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Average Case Time Complexity of Access (Singly Linked List)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Worst Case Time Complexity of Insertion (Hash Table)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Average Case Time Complexity of Insertion (Binary Search Tree)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Worst Case Time Complexity of Deletion (Binary Search Tree)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Average Case Time Complexity of Search (Hash Table)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)

Average Case Time Complexity of Binary Search (Linked List)

• O(Log(n))

• O(n)

• O(nLog(n))

• O(n^2)

Time Complexity of Insert at Tail (Linked List)

• O(1)

• O(n)

• O(Log(n))

• O(n^2)