Trees Questions

MCQ bookmark_border

21.

State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.

A

True, True

B

True, False

C

False, True

D

False, False

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

A

Unary tree

B

Binary tree

C

Trinary tree

D

Both B and C

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

State true or false.i) An empty tree is also a binary tree.ii) In strictly binary tree, the out-degree of every node is either o or 2.

A

True, False

B

False, True

C

True, True

D

False, False

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

A

FAEKCDBHG

B

FAEKCDHGB

C

EAFKHDCBG

D

FEAKDCHBG

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

A binary tree whose every node has either zero or two children is called

A

Complete binary tree

B

Binary search tree

C

Extended binary tree

D

None of above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

When representing any algebraic expression E which uses only binary operations in a 2-tree,

A

the variable in E will appear as external nodes and operations in internal nodes

B

the operations in E will appear as external nodes and variables in internal nodes

C

the variables and operations in E will appear only in internal nodes

D

the variables and operations in E will appear only in external nodes

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.

A

18

B

19

C

20

D

21

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

A full binary tree with 2n+1 nodes contain

A

n leaf nodes

B

n non-leaf nodes

C

n-1 leaf nodes

D

n-1 non-leaf nodes

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

If a node in a BST has two children, then its inorder predecessor has

A

no left child

B

no right child

C

two children

D

no child

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

The number of different directed trees with 3 nodes are

A

2

B

3

C

4

D

5

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion