Table of Contents

About

A binary heap is a binary tree with the additional property that the child nodes of every parent node should be smaller than the parent node.

Terminology

  • A max-heap is a binary heap where the nodes with the largest values are to be found at the top of the tree.
  • A min-heap is a binary heap where the nodes with the smallest values are to be found at the bottom of the tree.

Implementations


fuss/data_structures/trees/binary_trees/binary_heap.txt ยท Last modified: 2017/02/22 18:30 (external edit)

Access website using Tor Access website using i2p


For the copyright, license, warranty and privacy terms for the usage of this website please see the license, privacy and plagiarism pages.