Abstract Data Types Overview

Abstract Data Type

Data type with specified properties and operations independently of implementation

Levels of Abstraction

Different views of data: Application, Logical, Implementation

Stacks

Linear ADT storing items with Last In First Out (LIFO)

Queues

Linear ADT storing items with First In First Out (FIFO)

First In First Out (FIFO)

Ordering principle in queues where the first item inserted is the first to be removed

Stacks

Linear ADT storing items with Last In Last Out (LILO)

First In Last Out (FILO)

Ordering principle in stacks where the first item inserted is the last to be removed

Trees

Data structure allowing hierarchical storage of elements

Binary Trees

Trees where nodes have at most 2 children

Binary Search Tree

Binary tree with values following a specific order for efficient searching

BST Search Algorithm

Algorithm to search for a value in a Binary Search Tree

Graph

Data structure with nodes (vertices) and edges connecting them

Undirected Graph

Graph with edges having no direction

Directed Graph (Digraph)

Graph with directed edges from one vertex to another

Weighted Graph

Graph with values associated with edges representing costs