Menu

Question Discussion & Solution

MCQ

Q.

Each node of a tree stores a data value and has zero or more pointers pointing to the other nodes of the tree, which are also known as its__________.

A

Child nodes

B

Leaf nodes

C

Root

D

None of the above

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.

How many nodes in a tree have no ancestors.

B

1

C

2

D

n

Discussion

MCQ

2.

In the

A

Depth First

B

Breadth First

C

Width First

D

Depth Limited

Discussion

MCQ

3.

What is the maximum height of an AVL tree with p nodes?

A

p

B

log(p)

C

log(p)/2

D

p?2

Discussion

MCQ

4.

What is the time complexity to delete an element from the direct address table?

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(1)

Discussion

MCQ

5.

How can you save memory when storing color information in Red-Black tree?

A

using least significant bit of one of the pointers in the node for color information

B

using another array with colors of each node

C

storing color information in the node structure

D

using negative and positive numbering

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