ByteTrail

Level 2 · Module 16

Data Structures — Advanced

A structured module covering the essential ideas of data structures — advanced.

Difficulty
beginner
Published path
12 lessons · 120 min

What you will learn

  • Linked lists
  • Doubly linked lists
  • Hash tables
  • Trees
  • Binary trees
  • Binary search trees
  • Heaps
  • Priority queues
  • Graphs
  • Tries
  • Union-Find
  • Balanced trees
Prerequisites:Algorithm Complexity

Start here

Lessons · 120 min

  1. Linked listsPlanned

    Planned lesson: Linked lists. This lesson has not been written yet.

    10 min · beginner

  2. Doubly linked listsPlanned

    Planned lesson: Doubly linked lists. This lesson has not been written yet.

    10 min · beginner

  3. Hash tablesPlanned

    Planned lesson: Hash tables. This lesson has not been written yet.

    10 min · beginner

  4. TreesPlanned

    Planned lesson: Trees. This lesson has not been written yet.

    10 min · beginner

  5. Binary treesPlanned

    Planned lesson: Binary trees. This lesson has not been written yet.

    10 min · beginner

  6. Binary search treesPlanned

    Planned lesson: Binary search trees. This lesson has not been written yet.

    10 min · beginner

  7. HeapsPlanned

    Planned lesson: Heaps. This lesson has not been written yet.

    10 min · beginner

  8. Priority queuesPlanned

    Planned lesson: Priority queues. This lesson has not been written yet.

    10 min · beginner

  9. GraphsPlanned

    Planned lesson: Graphs. This lesson has not been written yet.

    10 min · beginner

  10. TriesPlanned

    Planned lesson: Tries. This lesson has not been written yet.

    10 min · beginner

  11. Union-FindPlanned

    Planned lesson: Union-Find. This lesson has not been written yet.

    10 min · beginner

  12. Balanced treesPlanned

    Planned lesson: Balanced trees. This lesson has not been written yet.

    10 min · beginner

What you will cover

Module units

  1. Linked lists

    A planned unit covering Linked lists.

  2. Doubly linked lists

    A planned unit covering Doubly linked lists.

  3. Hash tables

    A planned unit covering Hash tables.

  4. Trees

    A planned unit covering Trees.

  5. Binary trees

    A planned unit covering Binary trees.

  6. Binary search trees

    A planned unit covering Binary search trees.

  7. Heaps

    A planned unit covering Heaps.

  8. Priority queues

    A planned unit covering Priority queues.

  9. Graphs

    A planned unit covering Graphs.

  10. Tries

    A planned unit covering Tries.

  11. Union-Find

    A planned unit covering Union-Find.

  12. Balanced trees

    A planned unit covering Balanced trees.