CS 130 A: Data Structures and Algorithms - UCSB Computer Science

About this presentation

Leftist Heap is a priority queue data structure that also supports merge of two heaps in O(log n) time. Leftist heaps introduce an elegant idea even if you ...