en.</p>
<ul>
<li><p>height h, 2h+1-1 nodes, 2h-1 non-leaves, and 2h leaves</p></li>
</ul>
</li>
<li><p>Full Binary Tree</p>
<ul>
<li><p>A binary tree in which each node has exactly zero or two children.</p></li>
</ul>
</li>
<li><p>Min-heap - parent is min</p>
<ol class="arabic simple">
<li><p>Heap Structure Property: A binary heap is an almost complete binary tree, which is a binary tree that is completely filled, with the possible exception of the bottom level, which is filled left to right.</p>
<ul>
<li><