Data Structure Objective Questions and Answers Pdf - 3

Question: 11

A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

(A) Threaded tree

(B) Complete binary tree

(C) M-way search tree

(D) Full binary tree

Ans: B

Complete binary tree

Question: 12

Which of following data structure is more appropriate for implementing quick sort iteratively?

(A) Deque

(B) Queue

(C) Stack

(D) Priority queue

Ans: C

Stack

Question: 13

The number of edges in a complete graph of n vertices is

(A) n(n+1)/2

(B) n(n-1)/2

(C) n2/2

(D) n

Ans: B

n(n-1)/2

Question: 14

If two trees have same structure and but different node content, then they are called ___

(A) Synonyms trees

(B) Joint trees

(C) Equivalent trees

(D) Similar trees

Ans: D

Similar trees

Question: 15

If two trees have same structure and node content, then they are called ____

(A) Synonyms trees

(B) Joint trees

(C) Equivalent trees

(D) Similar trees

Ans: C

Equivalent trees

Related Questions