Advertisement

Heaps

  • Sammie Bae
Chapter

Abstract

This chapter will introduce heaps. A heap is an important data structure that returns the highest or lowest element in O(1) time. This chapter will focus on explaining how heaps are implemented as well as how to work with them. One example is heap sort, which is a sorting algorithm based on heaps.

Copyright information

© Sammie Bae 2019

Authors and Affiliations

  • Sammie Bae
    • 1
  1. 1.HamiltonCanada

Personalised recommendations