@@ -7,6 +7,9 @@ You can implement these notes in your own favourite programming language.
7
7
## Data Structures and Algorithms Patterns implemented in Python.
8
8
9
9
### Topics covered:
10
+ - [x] [ Graphs] ( Graphs )
11
+ - [x] [ Breadth First Search] ( Graphs/bfs.py )
12
+ - [x] [ Depth First Search] ( Graphs/dfs.py )
10
13
- [x] [ Recursion] ( Recursion )
11
14
- [x] [ Basic Problems] ( Recursion/Basic-Problems )
12
15
- [ x] [ Factorial] ( Recursion/Basic-Problems/factorial.py )
@@ -20,9 +23,6 @@ You can implement these notes in your own favourite programming language.
20
23
- [x] [ Remove Consecutive Duplicates] ( Recursion/Strings/removeconsecutiveduplicates.py )
21
24
- [x] [ Recursion on Linked List] ( Recursion/Linked-List )
22
25
- [x] [ Reverse Linked List] ( Recursion/Linked-List/Reverse-Linked-List.py )
23
- - [x] [ Graphs] ( Graphs )
24
- - [x] [ Breadth First Search] ( Graphs/bfs.py )
25
- - [x] [ Depth First Search] ( Graphs/dfs.py )
26
26
- [x] [ Searching Alogorithms] ( Searching-Algo )
27
27
- [x] [ Linear Search] ( Searching-Algo/linearsearch.py )
28
28
- [x] [ Binary Search] ( Searching-Algo/binarysearch.py )
@@ -32,12 +32,12 @@ You can implement these notes in your own favourite programming language.
32
32
- [x] [ Shell Sort] ( Sorting-Algo/shellsort.py )
33
33
- [x] [ Selection Sort] ( Sorting-Algo/selectionsort.py )
34
34
- [x] [ Bucket Sort] ( Sorting-Algo/bucketsort.py )
35
+ - [x] [ Stack And Queue] ( Trees )
36
+ - [x] [ Stack] ( Stack-and-Queue/stack.py )
37
+ - [x] [ Queue] ( Stack-and-Queue/queue.py )
35
38
- [x] [ Strings] ( Strings )
36
39
- [x] [ KMP (Knuth Morris Pratt) Pattern Searching] ( Strings/KMP.py )
37
40
- [x] [ Trees] ( Trees )
38
41
- [x] [ Binary Search Tree] ( Trees/binarysearchtree.py )
39
- - [x] [ Stack And Queue] ( Trees )
40
- - [x] [ Stack] ( Stack-and-Queue/stack.py )
41
- - [x] [ Queue] ( Stack-and-Queue/queue.py )
42
42
43
43
This repository is for the references, anyone can feel free to use this.
0 commit comments