Browse Prior Art Database

Resizeable dynamically allocated heap based priority queues

IP.com Disclosure Number: IPCOM000020111D
Original Publication Date: 2003-Oct-27
Included in the Prior Art Database: 2003-Oct-27

Publishing Venue

IBM

Abstract

By using a modified pointer based tree it is possible to maintain the same asymptotic characteristics of array based heaps while avoiding some of the problems that make them unsuitable for operating systems use.