Vidyalelo
Data Structure · Q223

Binary Search Trees(B Tree)

Programming · Data Structure · question 223

Q223

What is the speciality of cartesian sorting?

A.
it sorts partially sorted set of data quickly
Answer
B.
it considers cartesian product of elements
C.
it sorts elements in less than O(logn)
D.
it is a self balancing tree

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board