Ma’lumotlar tuzilmasi va algoritmlar

Nazorat savollar.

1. 
   Heap tree tuzilmasi nima?
   
2. 
   Heap tree binary daraxtdan qanday farqlari bor
   
3. 
   Heap tree ustida amal bajarish algoritmlari qanday?
   
4. 
   Heap treeni tashkil etishning “pastdan-tepaga” usuli va samaradorligi qanday?
   
5. 
   Heap treeni tashkil etishning “yuqoridan-pastga” usuli va samaradorligi qanday?
   
6. 
   Heap treeni qachon ishlatgan yahshi
   
7. 
   Williamning usulini tushuntiring
   
8. 
   Floydning usuli tushuntiring
   
9. 
   Williamning usuli bilan Floydning usulni qiyosiy taxlil qiling
   
10. 
    moveDown() funksiyasini tushuntiring
    

Adabiyotlar.
1.AdamDrozdek. Data structure and algorithms in C++. Fourth edition. 2013. Chapter 6.9. 268-276 betlar.
2.Ma’ruza matnlari. Carnegie Mellon University – CORTINA. 2010. 15-121 Introduction to Data Structures,
http://www.cs.cmu.edu/~tcortina/15-121sp10/lectures.html http://www.cs.cmu.edu/~tcortina/15-121sp10/Unit06B.pdf
3.Algorithms and data structures in C/C++ by Alex Allian. http://www.cprogramming.com/tutorial/computersciencetheory/heap.html