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.

Number of elements stored in any list is called its

A

Positioning

B

Sequencing

C

Model

D

Length

Discussion

MCQ

2.

End of any list is called its

A

Tail

B

Terminator

C

Aborter

D

Committer

Discussion

MCQ

3.

To delete a node from the end of a linked list, the list is traversed up to the last ______.

A

Pointer

B

Node

C

List

D

None of the above

Discussion

MCQ

4.

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

A

1036

B

1028

C

1038

D

None of these

Discussion

MCQ

5.

The disadvantage in using a circular linked list is

A

It is possible to get into infinite loop

B

Last node points to first node.

C

Time consuming

D

Requires more memory space

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