Flashcards
Exam 2
Cards in this deck (20)
- 1—14
- 2—12
- 3—33
- 4—47
- 5—47
- 6—23
- 7—47
- 8—17
- 9—10
- 10—O(n log(n))
- 11—O(n)
- 12—O(1)
- 13—If we maintain a tail pointer, the worst-case big-oh runtime for this sorted insertion remains unaffected.
- 14—O(1)
- 15—O(1)
- 16—O(1)
- 17—O(n)
- 18—O(n)
- 19—
- 20What is the runtime for searching for an element in a BSTBest Case: O(1)
Worst Case: O(n)
Average Case: O(logn)
Information
- Description
- University Course CS1 Flashcards on Exam 2, created by Zamin Shaikh on 17/01/2023.
- Created by
- Zamin Shaikh
- Views
- 5
- Rating