Table of Content
1. Big O Notation and Space Complexity
2. Essential Concepts (Memory and Logarithm)
3. Introduction to Data Structure
4. Arrays
5. Linked Lists
6. Stack and Queue
7. Hash Tables
8. Trees ( Binary trees, BST, AVL, Red Black Trees)
9. Heaps
10. Priority Queues
11. Tries
12. Graphs
13. Recursion
14. Searching Algorithms
15. Sorting Algorithm
16. Tree Traversal Algorithm
17. Graph Traversal Algorithms
Apply for Certification