PBL  The program base library
C# AvlDictionary and Priority Queue implementation

Classes  
class  AvlDictionary< TKey, TValue > 
AvlDictionary<TKey,TValue> is an implementation of the generic IDictionary<TKey,TValue> interface based on an AVLtree. The AvlDictionary<TKey,TValue> represents a collection of key/value pairs that are sorted on the key. More...  
class  PriorityQueue< T > 
PriorityQueue<T> is a C# implementation of a generic priority queue based on a binary minheap. This C# implementation provides O(log(n)) time for insertion methods; O(log(n)) time for removal methods; and constant time for retrieval methods. The implementation is derived from the List<T> class, therefore most List<T> methods can also be applied to a PriorityQueue<T>, however, List<T> methods that would destroy the heap condition of the priority queue will throw an InvalidOperationException, e.g. Reverse(). More...  