|
Data Structures and Algorithms
with Object-Oriented Design Patterns in C# |
This section presents an implementation of leftist heaps
that is based on the binary tree implementation
described in Section 
.
Program introduces the LeftistHeap class.
The LeftistHeap class extends the
BinaryTree class introduced in Program
and it implements the MergeablePriorityQueue interface
defined in Program .
Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.
