- Learned about Scapegoat trees - also learned about tries data structure - different types of tries like - Binary Tries, X-fast Tries, and Y-fast Tries
- Learned about Hashing - different types of collision resolutions like - Separate chaining, linear and quadratic probing, and double hashing - also learned about load factor and Rehashing
- Learned about graphs - Shortest path algorithms like Dijkstra's, Floyd Marshall - also learn about Minimum cost spanning tress, like Kruskal and Prim algorithm - Learned about BFS and DFS
- Learned about Advanced Trees Data Structures - AVL Trees, B-Trees, Splay Trees, and Red-Black Trees, and how to insert and delete operations in them.
- Learned about Queues Data Structure - Also Learned about different types of Queues and how to implement them using Arrays and Linked Lists in C language
- Learn about how strings work in C and the different string functions available in C - Learned about Stack Data Structure - also how to implement Stack using Arrays and Linked Lists