# 500+ Trees (Data Structure) MCQs with FREE PDF

We have the best collection of Trees (Data Structure) MCQs and answer with FREE PDF. These Trees (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Trees (Data Structure) MCQs

a) 4

b) 6

c) 5

d) 3

a) Brother

b) Sister

c) Mother

d) Parent

a) 2

b) 1

c) 0

d) 3

#### 4. How many extra nodes are there in Full ternary tree than a complete ternary tree?

a) 1

b) 2

c) 3

d) Both have same number of nodes

Answer: Both have same number of nodes

a) True

b) False

a) True

b) False

#### 7. Which of the following is the implementation of the ternary tree?

a) AVL Tree

b) Ternary Heap

c) Hash Table

d) Dictionary

50+ Ternary Tree MCQs with FREE PDF

#### 8. How many extra nodes are there in Full K-ary tree than complete K-ary tree?

a) 1

b) 2

c) 3

d) Both have same number of nodes

Answer: Both have same number of nodes

a) 2

b) 3

c) more than k

d) at most k

a) Brother

b) Sister

c) Mother

d) Parent

a) 2

b) 1

c) 0

d) 3

a) True

b) false

a) True

b) False

a) K*h

b) K^h

c) K+h

d) K-h

#### 15. What is the height of a K-ary tree having only root node?

a) 1

b) 0

c) 2

d) 3

50+ K-ary Tree MCQs with FREE PDF

a) Unbalanced

b) Balanced

c) Complete

d) Non – Binary

#### 17. What is the time complexity for inserting a key or integer in Van Emde Boas data structure?

a) O (log M!)

b) O (M!)

c) O (M2)

d) O (log (log M))

a) 1972

b) 1973

c) 1974

d) 1975

#### 19. What is the time complexity for deleting a key or integer in Van Emde Boas data structure?

a) O (log M!)

b) O (log (log M))

c) O (M!)

d) O (M2)

#### 20. What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?

a) O (log M!)

b) O (M!)

c) O (1)

d) O (log (log M))

#### 21. On which abstract data type does van Emde Boas tree performs the operation?

a) Tree

c) Heap

d) Associative Array

a) Insert

b) Find Next

c) Look up

d) Delete

#### 23. What is the other name or Van Emde Boas Tree data structure?

a) Van Emde Boas Array

b) Van Emde Boas Stack

c) Van Emde Boas Priority Queue

d) Van Emde Boas Heap

Answer: Van Emde Boas Priority Queue

50+ Van Emde Boas Tree MCQs with FREE PDF

a) O(N)

b) O(log N)

c) O(N log N)

d) O(M log N)

#### 25. Path Compression algorithm performs in which of the following operations?

a) Create operation

b) Insert operation

c) Find operation

d) Delete operation

#### 26. What is the definition for Ackermann’s function?

a) A(1,i) = i+1 for i>=1

b) A(i,j) = i+j for i>=j

c) A(i,j) = i+j for i = j

d) A(1,i) = i+1 for i<1

Answer: A(1,i) = i+1 for i>=1

#### 27. ___________ is one of the earliest forms of a self-adjustment strategy used in splay trees, skew heaps.

a) Union by rank

b) Equivalence function

c) Dynamic function

d) Path compression

a) O(N)

b) O(log N)

c) O(N log N)

d) O(M log N)

a) true

b) false

a) N

b) N/2

c) N/2r

d) Nr

#### 31. What is the worst-case running time of unions done by size and path compression?

a) O(N)

b) O(logN)

c) O(N logN)

d) O(M logN)

50+ Disjoint-Set Data Structure MCQs with FREE PDF

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

#### 33. What is computational geometry?

a) study of geometry using a computer

b) study of geometry

c) study of algorithms

d) study of algorithms related to geometry

Answer: study of algorithms related to geometry

a) O(1)

b) O(k)

c) O(k2)

d) O(log k)

a) O(1)

b) O(m)

c) O(m2)

d) O(log m)

a) O(1)

b) O(m)

c) O(m2)

d) O(log m)

#### 37. Efficiency of bin depends upon ___________

a) size of query and candidates

b) location of query and candidates

c) location and size of query and candidates

d) depends on the input

Answer: location and size of query and candidates

50+ Bin MCQs with FREE PDF

#### 38. In a k-d tree, k originally meant?

a) number of dimensions

b) size of tree

c) length of node

d) weight of node

#### 39. Each level in a k-d tree is made of?

a) dimension only

b) cutting and dimension

c) color code of node

d) size of the level

a) O(N)

b) O(N log N)

c) O( log N)

d) O(N3)

a) O(2+ log N)

b) O( log N)

c) O(2d log N)

d) O( N log N)

a) 1

b) 2

c) 3

d) 4

#### 43. Reducing search space by eliminating irrelevant trees is known as?

a) pruning

b) partial results

c) freeing space

d) traversing

50+ KD Tree MCQs with FREE PDF

#### 44. In a k-d tree, k originally meant?

a) number of dimensions

b) size of tree

c) length of node

d) weight of node

#### 45. Each level in a k-d tree is made of?

a) dimension only

b) cutting and dimension

c) color code of node

d) size of the level

a) O(N)

b) O(N log N)

c) O( log N)

d) O(N3)

a) O(2+ log N)

b) O( log N)

c) O(2d log N)

d) O( N log N)

a) 1

b) 2

c) 3

d) 4

#### 49. Reducing search space by eliminating irrelevant trees is known as?

a) pruning

b) partial results

c) freeing space

d) traversing

#### 50. Several kinds of queries are possible on a k-d called as?

a) partial queries

b) range queries

c) neighbour queries

d) search queries