intermediate

Array Linked List Stack Queue Sorting Trees - Binary…

Comprehensive AI-generated study curriculum with 1 detailed note module.

5 views 1 notes

Course Syllabus

  1. Fundamental Data Structures
  2. Searching and Sorting Algorithms
  3. Tree Data Structures
  4. Graph Theory Fundamentals and Algorithms
  5. Advanced Algorithms: Dynamic Programming & Greedy Approaches

Study Notes

Fundamental Data Structures

  • Pros:
    • Very fast to find an item if you know its index (direct access).
    • Data is stored contiguously in memory, which can be efficient.
  • Cons:
    • Fixed size: once you create an array, you can't easily change its capacity. If you need more space, you usually have to create a whole new, bigger array and copy everything over.
    • Adding or removing items in the middle can be slow because you might have to shift many other items.
Read full note →