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

- Option : C
- Explanation :

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

- Option : D
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : A
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.