This is a list of data structures and algorithms that are commonly used in computer science.
- Single, double list
- Traversal, insertion, deletion
- LinkedList algorithms
- Create Binary, BST, N-ary tree.
- Pre, Post, In, Level order traversal.
- Height, Depth, Diameter of tree.
- BFS, DFS, recursion on tree.
- Top, left, right, bottom, vertical, horizontal view or tree.
- Tree using linked list.
- Tree using graph.
- BFS (0-1, Multi source)
- DFS
- Cycle detection
- Bipartite graph
- Union-find
- Topological sort
- Dijkstra
- Bellman ford
- Floyd Warshal
- Kruskal
- Prims
- Articulation points & bridges
- Strongly connected components
- Euler tour
- Network flow
- Heapify, insertion, deletion, peek, max heap, min heap
- Binary heap
- Binomial heap
- Fibonacci heap
- Left list heap
- K-ary heap
- Linear search
- Binary search
- Interpolation search
- Bubble sort
- Selection sort
- Insertion sort
- Merge sort
- Quick sort
- Counting sort
- Shell sort
- Heap sort
- Radix sort
- Bucket sort
- 3-way merge sort
- Cycle sort
- Division
- Mid square
- Folding
- Hash algorithms