Trees in Data Structures MCQ question and answer with solution | Data Structure MCQs

A. O(2+ log N)

B. O( log N)

C. O(2^d log N)

D. O( N log N)

A. Binary search tree

B. Fibonacci tree

C. Binary tree

D. Treap

A. (30,40),(5,25),(70,70),(10,12),(50,30),(35,45)

B. (40,30),(5,25),(12,10),(70,70),(30,50),(45,35)

C. (30,40),(5,25),(10,12),(70,70),(50,30),(35,45)

D. (40,30),(25,5),(12,10),(70,70),(50,30),(45,35)

A. True

B. False

A. A

B. B

C. C

D. D

A. true

B. false

A. True

B. False

A. 1

B. 2

C. 3

D. 4

A. Create operation

B. Insert operation

C. Find operation

D. Delete operation

A. A

B. C

C. G

D. H