Created by Kumar...

Here You will get All DSA Concepts Implemented In Python Listed Below :

Sorting Techniques :-

1. Bubble Sort
2. Selection Sort
3. Insertion Sort
4. Quick Sort
5. Heap Sort

Array :-

Operations

1. Sortest Element
2. Linear Search
3. Binary Search
4. Max Heap

Stack :-

Implementations :

1. Using List
2. Using Deque
3. Using Class (Best Way)

Operations

1. Push
2. Pop
3. Display
4. isEmpty

Queue :-

Implementations :

1. Using List
2. Using Deque
3. Using queue
4. Using Class (Best Way)

Operations

1. Enqueue
2. Dequeue
3. Display
4. isEmpty
5. Heap Queue

Linked List :-

Implementations :

1. Singly Linked List
2. Singly Circular Linked List
3. Doubly Linked List

Operations

1. Insert At Begining (Prepend)
2. Insert At End (Append)
3. Insert At Index
4. Update Node
5. Remove First Node
6. Remove Last Node
7. Remove At Index
8. Size Of Linked List
9. Print Linked List

Tree :-

Implementations :

1. Binary Search Tree

Operations

1. Insert
2. Search
3. Delete
4. Inorder Traversal
5. Preorder Traversal
6. Postorder Traversal
7. Find Minimum Value
8. Find Maximum Value
9. Height

Tries :-

Operations

1. Insert
2. Search

Graph :-

Implementations :

1. Adjacency List Graph
2. Adjacency List Weighted Graph

Operations

1. Breadth First Search
2. Depth Firsth Search
3. Print All Paths From Source to Target
4. Cycle Detection (Directed Graph)
5. Cycle Detection (Undirected Graph)
6. Dijkstra's Algorithm
7. BellmanFord Algorithm
8. Prim's Algorithm (MST)
9. Topological Sort
10. Kosaraju's Algorithm (SCC)
11. Tarjans's Algorithm (Bridge in Graph)
12. Tarjans's Algorithm (Articulation Point in Graph)
13. Floyd Warshall Algorithm