UGC-NET | UGC NET CS 2017 Jan – III | Question 32

Any decision tree that sorts n elements has height ________.

(A)

Ω(log n)

(B)

Ω(n)

(C)

Ω(n log n)

(D)

Ω(n²)

Answer: (A)
Explanation:

Any decision tree that sorts n elements has height log n.

Quiz of this Question
Please comment below if you find anything wrong in the above post