Heap

Linked Binary Hash (Binary

Aspect Array List Stack Queue Tree Table Heap) Graph
Nodes Uses a Uses a
Contiguou scattered stack queue Hierarchic Array- Complete
s memory in memory memory al based binary Vertices
Storage block memory structure structure structure indexing tree and Edges

O(n) at Depends O(log n) Depends

Insertion/ arbitrary O(1) at O(1) at O(1) at on the Average: for O(1) for on the
Deletion index head/tail the top the rear operation O(1) insertion extraction operation
O(1) at O(1) with
Random specific Not Not Not Not hash Not Not
Access index applicable applicable applicable applicable function applicable applicable
May have
Dynamica empty
may lly Depends slots due
Memory waste allocates efficient efficient on the to
Efficiency Fixed size space memory Fixed size use Fixed size use height collisions
O(n) O(n)
linear linear Not Not post- Not Not
Traversal traversal traversal applicable applicable In-order pre-order order applicable applicable
Depends
O(n) O(n) on the O(1) Depends
linear linear Not Not search average Not on the
Search search search applicable applicable algorithm case applicable algorithm
Depends
on
Ordered represent
Structure Yes No No No No No No ation

Dynamic undo Task Hierarchic

General- memory Function operation schedulin print al data Associativ data
Usage purpose allocation calls s g queue storage e array lookup
Efficient Efficient
use of use of
memory memory

Depth- Breadth-
first first

Represent
Priority Dijkstra's connectio
queue algorithm ns