CPSC 259 FInal

please let me pass

Binary Heap

Binary Heap

Complete Binary Tree

Binary Heap: Min Heap

Value of a node is no greater than its childrens values

Binary Heap: Max Heap

Value of a node is at least as large as its childrens values

Perfect tree

full and complete

full tree

every node has 0 or 2 childrena binary tree where every node has either zero or two children

complete tree

all leaves are full except last level

max nodes in a tree

n = (k^h-1)/(k-1)
n = max nodes

k = #ary

h = height