Register

NIELIT 2016 DEC Scientist B (CS) - Section B: 15

• retagged by
1,687 views
1 votes
1 votes

Which of the following need not be a binary tree?

  1. Search tree
  2. Heap
  3. AVL tree
  4. B tree
• retagged by
User Avatar

5 Answers

0 votes
0 votes

D is the most appropriate answer.

A B-tree is a specialized M-way tree i.e. each node can have at most m childrens.

AVL tree and Heap are usually a complete binary tree.

Search Tree(assuming binary search tree). Therefore it is a binary tree.

User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
5
admin asked Mar 31, 2020
1,095 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 42
The maximum number of nodes in a binary tree of level $k, k\geq1$ is: $2^k+1$ $2^{k-1}$ $2^k-1$ $2^{k-1}-1$
The maximum number of nodes in a binary tree of level $k, k\geq1$ is:$2^k+1$$2^{k-1}$$2^k-1$$2^{k-1}-1$
User Avatar
1 votes
1 votes
2 answers
7
admin asked Mar 31, 2020
3,923 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 2
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as:normalization of data.denomination of data.isolatio...
User Avatar
2 votes
2 votes
3 answers
8
admin asked Mar 31, 2020
776 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 3
If $L1$ is CFL and $L2$ is regular language which of the following is false? $L1-L2$ is not Context free $L1$ intersection $L2$ is Context free $\sim L1$ is Context free Both (A) and (C)
If $L1$ is CFL and $L2$ is regular language which of the following is false?$L1-L2$ is not Context free$L1$ intersection $L2$ is Context free$\sim L1$ is Context freeBoth...
User Avatar
Link Copied!