๐Ÿงฉ Programming Through Pseudocode
PHASE 08

๐Ÿงฑ Data Structures

Organise data so your algorithms shine. Learn stacks, queues, linked lists, hash tables, trees, binary search trees, heaps, priority queues and graphs โ€” and when to use each.

โฑ๏ธ 3โ€“4 weeks ๐Ÿ“š 15 lessons โœ๏ธ 1 exercises Hard

๐ŸŽฏ In this phase you willโ€ฆ

  • Use stacks and queues for real scenarios
  • Explain linked lists and hash tables
  • Work with trees and binary search trees
  • Understand heaps and priority queues
  • Model problems as graphs of nodes and edges

๐Ÿ“บ Lessons in this playlist

01 Why Data Structures? ๐Ÿšง Coming soon
02 Stack ๐Ÿšง Coming soon
03 Queue ๐Ÿšง Coming soon
04 Linked List ๐Ÿšง Coming soon
05 Hash Table / Map ๐Ÿšง Coming soon
06 Tree ๐Ÿšง Coming soon
07 Binary Tree ๐Ÿšง Coming soon
08 Binary Search Tree ๐Ÿšง Coming soon
09 Heap ๐Ÿšง Coming soon
10 Priority Queue ๐Ÿšง Coming soon
11 Graph ๐Ÿšง Coming soon
12 Nodes and Edges ๐Ÿšง Coming soon
13 Directed / Undirected Graphs ๐Ÿšง Coming soon
14 Weighted Graphs ๐Ÿšง Coming soon
15 Choosing Data Structures ๐Ÿšง Coming soon