Binary Heap and Trees

Binary Tree

A classic data structure comprising a finite set of nodes that can be empty or structured with a root node and left/right subtrees.

Leaf Node

A node in a binary tree with two empty subtrees.

Internal Node

Any non-leaf node in a binary tree.

Full Binary Tree

A binary tree where every node is either a leaf or has two non-empty subtrees.

Complete Binary Tree

A full binary tree in which each leaf node is at the same depth.

Nearly-Complete Binary Tree

A complete binary tree to depth d-1 with remaining nodes filled from left to right at depth d.

Binary Heap

A nearly-complete binary tree where each parent node has a higher priority than its children.

Percolate Up

The process of moving a node up in the heap until the heap property is restored.

Percolate Down

The process of moving a node down in the heap to restore the heap property after removal.

Priority Queue

A class implemented