Programming and Data Structures - Trees

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Programming and Data Structures > > Trees

16. The maximum number of nodes on level i of a binary tree is

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

18. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Answer
Comment
Array

Option : B
Explanation : A strictly binary tree with 'n' leaves must have (2n � 1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction.

You must be logged in to post a comment.

You must be logged in to post a comment.

19. Number of possible binary trees with 3 nodes is

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

20. A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from the root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Trees

Forgot your password?

I agree with the Terms.