Fundamentals of Data Structure and Algorithm

Special Format for storing and organizing data

• Algorithm

• Algorithm Design

• Data Structure

• Data Algorithm

A complete binary tree where the value of each of each parent node is either higher or lower than the value of its child nodes.

• Tree

• Heap

• Queue

• Linked List

an ordered list in which the first element added is the first element retrieved or removed (First-In, FirstOut).

• Heap

• Tree

• Stack

• Queue

an ordered list in which the last element added is the first element retrieved or removed (Last-In, First-Out).

• Stack

• Queue

• Tree

• Heap

It has branches - represents a hierarchical nature of a structure in a graphical form.

• Heap

• Queue

• Tree

• Stack

used for storing elements where each is a separate object.

• Priority Queue

• Linked-List

• Set

• Map

A collection of elements where each element is unique.

• Set

• Map

• Priority Queue

• Linked-List

a special type of queue where elements are processed based on their order (natural or custom).

• Set

• Map

• Priority Queue

• Linked-List

a set of ordered pairs where elements are known as keys (identifiers) and values (content).

• Set

• Priority Queue

• Graph

• Map

consists of a set of vertices (or nodes) and a set of edges (relations) between the pairs of vertices.

• Map

• Graph

• Priority Queue

• Set