Implement Core Data Structures From Scratch with Complexity Analysis

6 weeks · 0 milestones

Implement a linked list, binary search tree, hash table, min-heap, and adjacency-list graph from scratch in any language — no library primitives for the core data structure logic. Each implementation must include a full test suite covering edge cases and a documented time and space complexity analysis explaining why each operation has the stated complexity (not just stating it). Proof: the implementations and analysis reviewed by a CS lecturer or senior software engineer who asks 'why is your hash table O(1) amortised for insertion rather than O(1) worst-case?' — you must answer by pointing to your specific implementation and the conditions that trigger rehashing.

Sign in to start this outcome and track your progress publicly.