Back to Results
First PageMeta Content
Computer programming / Abstract data types / Heap / Binary heap / Min-max heap / Binary trees / Sorting algorithms / Leftist tree / Double-ended priority queue / Priority queues / Mathematics / Computing


Document Date: 2002-09-16 17:06:43

Open Document

File Size: 481,25 KB

Share Result on Facebook

City

Stuttgart / Reading / Baltimore / /

Company

Data Structures Ian Munro / /

Country

Germany / Canada / /

Facility

Carleton University / /

IndustryTerm

linear-time algorithms / heap algorithms / linear-time heap construction algorithm / min-max heap algorithms / balanced binary search trees / /

Organization

School of Computer Science / Carleton University / Ottawa / National Council of Canada / School of Comput / Association for Computing Machinery / /

Person

Addison Wesley / Min-Max Heaps / Min-Max Heaps Create Insert DeleteMin / Mb-Heaps Heaps Create Insert DeleteMin / Min-Max Heap / Generalized Priority Queues / Max Heaps / Max Heap / /

Position

Editor / Problems General / /

ProvinceOrState

Maryland / Hawaii / Massachusetts / Ontario / /

PublishedMedium

the Communications of the ACM / Communications of the ACM / /

Technology

known linear-time algorithms / An algorithm / linear-time heap construction algorithm / heap algorithms / J.W.J. Algorithm / min-max heap algorithms / R.W. Algorithm / /

SocialTag