.pf{position:relative;background-color:#fff;overflow:hidden;margin:0;border:0}.pc{position:absolute;border:0;padding:0;margin:0;top:0;left:0;width:100%;height:100%;overflow:hidden;display:block;transform-origin:0 0;-ms-transform-origin:0 0;-webkit-transform-origin:0 0}.bi{position:absolute;border:0;margin:0}.pi{display:none}@media screen{.pf{margin:13px auto;box-shadow:1px 1px 3px 1px #333;border-collapse:separate}}.y0{bottom:51.241663px}.h1{height:912.101594px}.h0{height:1014.58492px}.w1{width:684.716717px}.w0{width:783.997438px}.x0{left:49.960621px}

CS 1332 Lecture 8: Heaps and PQ (and some trees)

United States

Data Structures and Algorithms for Applications

Computer Science

Mary Hudachek-Buswell

Georgia Institute of Technology

Computer Organization and Programming

Introduction to Cognitive Science

Special Topics

All Subjects

Accounting

Mathematics

Statistics

Calculus

Psychology

Management

Biology

Physics

Chemistry

Electrical Engineering

Mechanical Engineering

Marketing

Music

History

Project Management

Business

Architecture

Geography

Science

Nursing

Information Technology

Engineering

English

Finance

Philosophy

Astronomy

Communications

Sociology

Anthropology

Prealgebra

Algebra

Precalculus

Ethics

Geometry

Probability

Economics

CS 1332 Lecture 8: Heaps and PQ (and some trees)

Get access