What Are The Disadvantages Of Representing A Stack Or Queue By A Link

1.	What Are The Disadvantages Of Representing A Stack Or Queue By A Linked List?
Answer» i) A node in a linked list (info and next field) OCCUPIES more storage than a corresponding ELEMENT in an array. II) Additional time spent in managing the AVAILABLE list. i) A node in a linked list (info and next field) occupies more storage than a corresponding element in an array. ii) Additional time spent in managing the available list.

What Are The Disadvantages Of Representing A Stack Or Queue By A Linked List?

Answer»

i) A node in a linked list (info and next field) OCCUPIES more storage than a corresponding ELEMENT in an array.
II) Additional time spent in managing the AVAILABLE list.

i) A node in a linked list (info and next field) occupies more storage than a corresponding element in an array.
ii) Additional time spent in managing the available list.

Discussion

No Comment Found

Related InterviewSolutions

Difference Between Abstract Data Type, Data Type And Data Structure?
Define Data Type And What Are The Types Of Data Type?
Define An Abstract Data Type (adt)?
What Are The Advantages Of Modularity?
State The Difference Between Primitive And Non-primitive Data Types?
State The Difference Between Persistent And Ephemeral Data Structure?
What Are The Objectives Of Studying Data Structures?
What Are The Types Of Queues?
List The Applications Of Stacks?
List The Applications Of Queues?

What Are The Disadvantages Of Representing A Stack Or Queue By A Linked List?

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment