Data-Structures-Algorithms

This repository provides implementations of popular algorithms and abstract data types using JAVA.

Why does this repository exist?

This repository contains the syllabus for the subject Data Structures and Algorithms I took in Computer Science at UPV. I used it to track the subject.

Are the implementations recursive or iterative?

You can find both, but I tend to solve things iteratively for obvious reasons.

Is it complete?

No, the algorithms part got lost, and I am planning to write everything in a more elegant language like Python or C#, but it is not a priority. You can find the repository structure below:

Course

Linear Abstract Data Types

1. List

   • ArrayList
   • LinkedList

2. Stack

   • ArrayStack
   • LinkedStack

3. Queue

   • ArrayQueue
   • LinkedQueue

Set Abstract Data Types

1. Set

   • ArrayBit
   • LinkedSet

2. Priority Queue

   • Heap

3. Dictionary

   • Hash table

Tree Abstract Data Types

1. Binary Search Tree
2. AVL Binary Search Tree

Graph Abstract Data Types

1. Directed Graph

   • Adjacency List
   • Adjacency Matrix

2. Undirected Graph

   • Adjacency List
   • Adjacency Matrix