Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

71) A binary tree of depth d is an almost complete binary tree if

Answer is:

each leaf in the tree is either at level and for any node

72) If each node in a tree has value greater the every value in its left sub-tree and has value less than every value in its right sub-tree, the tree is called

Answer is:

Binary search tree

73) The number of nodes in a complete binary tree of level 5 is

Answer is:

63

74) The maximum number of nodes on level i of a binary tree is

Answer is:

2i-1

75) The smallest number of key that will force a B-tree of order 3 to have a height 3 is

Answer is:

7

12
13
14
15
16
17
18