Match the following and choose the correct answer in the order A, B, C

A.

Heap Construction

p.

O(nlogn)

B.

Hash table construction with linear probing

q.

O (n² )

C.

AVL Tree construction

r.

O(n)

(Bounds given may or may not be asymptotically tight)

Question

A.	Heap Construction	p.	O(nlogn)
B.	Hash table construction with linear probing	q.	O (n² )
C.	AVL Tree construction	r.	O(n)

Match the following and choose the correct answer in the order A, B, C A. Heap Construction p. O(nlogn) B. Hash table construction with linear probing q. O (n2 ) C. AVL Tree construction r. O(n) (Bounds given may or may not be asymptotically tight)