2
Heaps
Heaps can be viewed as trees with top-to-bottom ordering
(cf. binary search trees which have left-to-right ordering)
![[prev]](icon/prev.gif){kind=icon}
2
![[next]](icon/next.gif){kind=icon}
![[Diagram:Pics/heaps/heap-bst.png]](Pics/heaps/heap-bst.png)