DataStructure quick pick

Got this in the mail from my brother. Feel its handy. It might be from some source, which I don’t know, hence unable to quote otherwise would have.
Nonethelss worth saving in this post too.

Data Structure: Array
Advantages: Quick Insertion, Very fast access if index known
Disadvantage: Slow search, slow deletion, fised size

Data Structure: Ordered array
Advantages: Quicker search than unsorted array
Disadvantage: Slow insertion and deletion, fixed size

Data Structure: Stack
Advantages: Provides LIFO
Disadvantage: Slow access to other items

Data Structure: Queue
Advantages: Provides FIFO
Disadvantage: Slow access to other items

Data Structure: Linked List
Advantage: Quick insertion, quick deletion
Disadvantage: Slow search

Data Structure: Binary Tree
Advantage: Quick Search, insertion, deletion (if tree remains balanced)
Disadvantage: Deletion Algorithm is complex

Data Structure: Red-Black tree
Advantage: Quick search, insertion, deletion. Tree always balanced
Disadvantage: Complex

Data Structure: 2-3-4 tree
Advantage: Quick search, insertion, deletion. Tree always balanced. Similer trees good for disk storage.
Disadvantage: Complex

Data Structure: Hash table
Advantage: Very fast access if key known. Fast insertion.
Disadvantage: Slow deletion, access slow if key not known, inefficient memory usage.

Data Structure: Heap
Advantage: Fast insertion, deletion, access to largest item.
Disadvantage: Slow access to other items.

Data Structure: Graph
Advantage: Model real world situation
Disadvantage: Some algorithms are slow and complex.

Advertisement