What is The Sequence of Learning Data Structures and Algorithms

In this post i will tell you one of the important thing how data structures and algorithms is learning process. Many students or Beginner will confuse where to start to learn Data Structure and algorithms. Here is the right place to know it. The following sequences of learning Data Structures and Algorithms for all.

1. Arrays(Sorting, searching, adding , deleting, traversing)
2. singly linked-list using Arrays
3. doubly linked-list using Arrays
4. circular linked-list using Arrays
5. doubly circular linked-list using Arrays
6. queue using arrays
7. circular queue using arrays
8. stack using arrays
9. double stack using arrays
10. Repeat all of the above using ‘struct’ in both ‘recursive’ and ‘non-recursive’ implementations.
11. trees using structs
12. Binary search tree
13. AVL Trees
14. RB Trees
15. Graphs

Algorithms:

• Searching algorithms
• Sorting algorithms
• Maximum and minimum element in a data structure
• Sum and average of all elements in the data structures
• Inorder, preorder and post-order tree traversals
• BFS and DFS
• Graph algorithms- Shortest path
• Greedy algorithms
• Divide and conquer
• Backtracking
• Dynamic programming