BigO Flashcards

1
Q

What is the worst access time of an array?

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the worst access time of a stack?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the worst access time of a singly-linked list?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the worst access time of a doubly-linked list?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the worst access time of a skip list?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the worst access time of a hash table?

A

NA

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the worst access time of a binary search tree?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the worst access time of a cartesian tree?

A

NA

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the worst access time of a b-tree?

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the worst access time of a red-black tree?

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the worst access time of a splay tree?

A

NA

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the worst access time of a AVL tree?

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the worst search time of an array?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the worst search time of a stack?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the worst search time of a singly-linked list?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the worst search time of a doubly-linked list?

A

O(n)

17
Q

What is the worst search time of a skip list?

A

O(n)

18
Q

What is the worst search time of a hash table?

A

O(n)

19
Q

What is the worst search time of a binary search tree?

A

O(n)

20
Q

What is the worst search time of a Cartesian tree?

A

O(n)

21
Q

What is the worst search time of a b-tree?

A

O(log(n))

22
Q

What is the worst search time of a red-black tree?

A

O(log(n))

23
Q

O(log(n))

A

O(log(n))

24
Q

What is the worst search time of a AVL tree?

A

O(log(n))

25
Q

What is the worst insertion/deletion time of an array?

A

O(n)

26
Q

What is the worst insertion/deletion time of a stack?

A

O(1)

27
Q

What is the worst insertion/deletion time of a singly-linked list?

A

O(1)

28
Q

What is the worst insertion/deletion time of a doubly-linked list?

A

O(1)

29
Q

What is the worst insertion/deletion time of a skip list?

A

O(n)

30
Q

What is the worst insertion/deletion time of a hash table?

A

O(n)

31
Q

What is the worst insertion/deletion time of a binary search tree?

A

O(n)

32
Q

What is the worst insertion/deletion time of a Cartesian tree?

A

O(n)

33
Q

What is the worst insertion/deletion time of a b-tree?

A

O(log(n))

34
Q

What is the worst insertion/deletion time of a red-black tree?

A

O(log(n))

35
Q

What is the worst insertion/deletion time of a splay tree?

A

O(log(n))

36
Q

What is the worst insertion/deletion time of a AVL tree?

A

O(log(n))