Menu

Question Discussion & Solution

MCQ

Q.

Disadvantages of linked list representation of binary trees over arrays?

A

Randomly accessing is not possible

B

Extra memory for a pointer is needed with every element in the list

C

Difficulty in deletion

D

Random access is not possible and extra memory with every element

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.

First link node of list is accessed from a pointer named

A

Tail

B

Head

C

Terminator

D

Initiator

Discussion

MCQ

2.

If a list contains no elements it is said to be

A

Hollow

B

Empty

C

Finite

D

Infinite

Discussion

MCQ

3.

In Circular Linked List insertion of a node involves the modification of ____ links.

A

3

B

4

C

1

D

2

Discussion

MCQ

4.

What is the functionality of the following code? Choose the most appropriate answer.

A

Return data from the end of the list

B

Returns the data and deletes the node at the end of the list

C

Returns the data from the beginning of the list

D

Returns the data and deletes the node from the beginning of the list

Discussion

MCQ

5.

In doubly linked lists, traversal can be performed?

A

Only in forward direction

B

Only in reverse direction

C

In both directions

D

None of the above

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