HOLLOW VICTORY HEAPS

This thesis introduces Hollow Victory Heaps, a binary version of Quake Heaps that incorporates concepts from Hollow Heaps. The proposed data structure features simpler operations while maintaining efficiency comparable to the well-known, yet complex, Fibonacci Heaps. It supports the insert and decrease-key operations in amortized 0(1) time, and the delete-min operation in amortized 0(log n) time. Additionally, we believe that Hollow Victory Heaps is an excellent choice for educational purposes, as its hollow concept simplifies the understanding of heap operations and effectively demonstrates key principles of advanced heap structures.