Data structures
Trees, Heaps, and Priority Queues
Shape lemmas, heap orders, and operational profiles for production batch jobs.
Cohort 5 weeks · cohort Intermediate
620 GEL
Informational price—final fees appear on your admissions letter.
Request information
We compare binary heaps, pairing heaps, and lazy structures with runtime charts from modest hardware so intuition matches reality.
- Heap shape tracing mats
- Decrease-key controversy discussion
- Batch job simulation notebooks
- Latency spreadsheet templates
- Pair tuning of d-ary heaps
- Safety review for mutable priorities
- Capstone profiling memo
- Pick heap flavour using workload evidence
- Explain why decrease-key complicates Fibonacci heaps
- Document invariants for lazy structures
Lasha Tediashvili
Practice lead for systems-leaning structures.
Do we implement Fibonacci heaps?
We analyse them on paper; implementation focuses on binary and pairing heaps.
Language?
Go or Rust recommended for profiling labs.
Limitations?
No GPU priority queues or lock-free heaps.
“Trees, Heaps, and Priority Queues finally connected shape lemmas to our nightly batch alerts.”
Nini “Pair tuning lab on d-ary heaps surfaced a config mistake we had shipped for months.”
Giga · Regional bank tech · survey 