Data Structures:
- List
- Queue
- Heap
- Tree
- Graph
Queue
A queue follows the method “first in, first out” (FIFO).
Heap
A heap can be used to work on arithmetic operations using postfix notation.
It follows the method “last in, first out” (LIFO).
Tree
A tree is a set of nodes placed hierarchically.
Graph
The grade of a node is the number of lines that comes to that node.
A connected graph is a graph in which any vertex can be reached from any other vertex by following one or more edges.
An unconnected graph is a graph where there are vertexes that cannot be reached from other vertexes.
A completed graph is a graph in which each pair of graph vertices is connected by an edge
A directed graph is a graph in which the edges have a direction.