Data Structures in Python3

Data Structures

Linked Lists

Implemented: Add, delete by position, delete by value, reverse list, search and print list (forward/ reverse).

• Single Linked List
• Double Linked List
• Circular Double Linked List
• Circular Single Linked List

Trees

Implemented: Search, Insert, Delete, Inorder, Preorder, Postorder and Levelorder traversals.

• Binary Search Tree
• AVL Tree

Heaps

Implemented: Insertion, Deletion, extractMax/extractMin, getMax/getMin

• Max Heap
• Min Heap

Graphs

Implemented: Weighted/ Unweighted, BFS, DFS, Djikstra's shortest path, Prim's MST.

• Undirected Adjacency Matrix Graph
• Undirected Adjacency List Graph
• Directed Adjacency Matrix Graph
• Directed Adjacency List Graph

Disjoint set

Implemented: Find (Path compression), Union (By rank)

• Disjoint set

Status

Not yet complete.

Contributions

• If you want to add a new file, make sure it follows PEP conventions and open a pull request.
• If you find an issue with any of the existing files, kindly raise an issue.