Menu

Question Discussion & Solution

MCQ

Q.

State true or false.i) The degree of root node is always zero.ii) Nodes that are not root and not leaf are called as internal nodes.

A

True, True

B

True, False

C

False, True

D

False, False

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Which concept is useful while writing programming code for implementing various operations on trees?

A

Recursion

B

Huffman

C

Internal nodes

D

None of the above

Discussion

MCQ

2.

A

Unary tree

B

Binary tree

C

Trinary tree

D

Both B and C

Discussion

MCQ

3.

A node of the weight balanced tree has

A

key, left and right pointers, size

B

key, value

C

key, size

D

key

Discussion

MCQ

4.

What is the time complexity to insert an element into the direct address table?

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(1)

Discussion

MCQ

5.

The number of different directed trees with 3 nodes are

A

2

B

3

C

4

D

5

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs