Top 350+ Solved Data Structures (DS) MCQ Questions Answer

a. Priority queue

b. Hash table

c. Heap sort

d. Priority queue and Heap sort

a. AVL tree

b. AA tree

c. Splay tree

d. Red – Black tree

a. log2(n)

b. n

c. 2n + 1

d. 2n – 1

a. a tree which is balanced and is a height balanced tree

b. a tree which is unbalanced and is a height balanced tree

c. a tree with three children

d. a tree with atmost 3 children

a. to avoid formation of skew trees

b. to save memory

c. to attain faster memory access

d. to simplify storing

a. just build the tree with the given input

b. find the median of the set of elements given, make it as root and construct the tree

c. use trial and error

d. use dynamic programming to build the tree

a. log(n) where n is the number of nodes

b. n where n is the number of nodes

c. 0 or 1

d. atmost 1

a. Height(w-left), x-height

b. Height(w-right), x-height

c. Height(w-left), x

d. Height(w-left)

a. Because red-black is more rigidly balanced

b. AVL tree store balance factor in every node which costs space

c. AVL tree fails at scale

d. Red black is more efficient

a. AVL tree

b. B-tree

c. Red-black tree

d. Both AVL tree and Red-black tree

a. at most (n – 1)/2 keys

b. exact (n – 1)/2 keys

c. at least 2n keys

d. at least (n – 1)/2 keys

a. 255

b. 63

c. 127

d. 188

a. 14

b. 7

c. 11

d. 5

a. AVL

b. AA

c. 2-3

d. Red-Black

a. logn (k+1) – 1

b. nk

c. logk (n+1) – 1

d. klogn