Lecture Data structures and other objects using C++ - Chapter 11: Heaps - Trường Đại học Công nghiệp Thực phẩm Tp. Hồ Chí Minh

<span class='text_page_counter'>(1)</span><div class='page_container' data-page=1>

Chapter 11 has several 

programming projects, including a 

project that uses 

heaps

. 

</div>
<span class='text_page_counter'>(2)</span><div class='page_container' data-page=2>

A 

heap 

is a 

certain kind of 

complete 

</div>
<span class='text_page_counter'>(3)</span><div class='page_container' data-page=3>

A 

heap

 is a 

certain kind of 

complete 

binary tree.

When a complete
binary tree is built,
its first node must be

</div>
<span class='text_page_counter'>(4)</span><div class='page_container' data-page=4>

Complete 

binary tree.

Left child
of the

root

The second node is
always the left child

</div>
<span class='text_page_counter'>(5)</span><div class='page_container' data-page=5>

Complete 

binary tree.

of the_root

The third node is
always the right child

</div>
<span class='text_page_counter'>(6)</span><div class='page_container' data-page=6>

Complete 

binary tree.

</div>
<span class='text_page_counter'>(7)</span><div class='page_container' data-page=7>

Complete 

binary tree.

</div>
<span class='text_page_counter'>(8)</span><div class='page_container' data-page=8>

Complete 

binary tree.

</div>
<span class='text_page_counter'>(9)</span><div class='page_container' data-page=9>

Complete 

binary tree.

</div>
<span class='text_page_counter'>(10)</span><div class='page_container' data-page=10></div>

<!--links-->