Artificial Intelligence & Data Science is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Artificial Intelligence & Data Science

Data Structures

Complexity, searching and sorting, hashing, linked lists, stacks and queues, trees, graphs.

Interview questions

Coming next in Data Structures

  1. Data structures and their types· notes coming
  2. Time and space complexity· notes coming
  3. Asymptotic notations· notes coming
  4. Sequential and binary search· notes coming
  5. Insertion, bubble and selection sort· notes coming
  6. Merge sort and quick sort· notes coming
  7. Radix sort· notes coming
  8. Hashing and collision resolution· notes coming
  9. Static and dynamic memory allocation· notes coming
  10. Circular linked lists· notes coming
  11. Doubly linked lists· notes coming
  12. Polynomial addition with linked lists· notes coming
  13. Generalised linked lists· notes coming
  14. Stack ADT and operations· notes coming
  15. Expression conversion and evaluation· notes coming
  16. Recursion· notes coming
  17. Queue ADT and operations· notes coming
  18. Circular queues· notes coming
  19. Deques and priority queues· notes coming
  20. Tree terminology and representation· notes coming
  21. Binary tree traversals· notes coming
  22. Threaded binary trees· notes coming
  23. Optimal binary search trees· notes coming
  24. AVL trees· notes coming
  25. Heaps· notes coming
  26. DFS and BFS· notes coming
  27. Prim's and Kruskal's algorithms· notes coming
  28. Dijkstra's algorithm· notes coming
  29. Floyd-Warshall algorithm· notes coming
  30. Topological sorting· notes coming
  31. Abstract data types· notes coming
  32. Arrays and sparse matrices· notes coming
  33. Open addressing and perfect hashing· notes coming
  34. Garbage collection· notes coming
  35. Warshall's algorithm for transitive closure· notes coming
  36. Skip lists· notes coming
  37. File handling· notes coming
  38. Linked stacks and queues· notes coming
  39. B-trees and B+ trees· notes coming
  40. Hash functions and their applications· notes coming
  41. Shell sort· notes coming
  42. Red–black trees· notes coming
  43. String processing and pattern matching· notes coming