Daraxtsimon ma’lumotlar tuzilmasi

LABORATORIYA ISHI - 6

Daraxtsimon ma’lumotlar tuzilmasi

1-QISM
Daraxt kuruvini tashkil qiling. (CHIZMA BO’LISHI KERAK!!!!)


(a) Inorder (simmetrik)
(b) Preorder (to’g’ri)
(c) Postorder (teskari)
Variantlar

1. 
   5, 3 ,2, 10, 14, 13 ,56, 12, 33, 23, 1,32,35,70,59
   
2. 
   7,4,2,5, 14,12,13,11,18,15,17,16,3,1,20,19,24
   
3. 
   19, 14,12,15,13,10,21,19,24,28,25,26,23,33,30,35,34
   
4. 
   35,44,21,25,23,20, 42,43, 41, 15, 17,47,45,46,49,48
   
5. 
   43, 30,25,27,29, 26, 49,46, 48,47, 55,53,54,59,58,60
   
6. 
   30,25,26,23,24,39,35, 33,34,41,40,42,31,32,46,44,45,
   
7. 
   42, 30,35,33,36,34,29,27,28,26,47,45,46,43
   
8. 
   36,23,25,24,20,21,24,15,13,40,37,38,39,42
   
9. 
   19, 11,9, 5,8,10,15,14,17,16,18,25,22,27,26
   
10. 
    33,24,27,20, 28,14,16,11,13,10,38,35,34,36
    
11. 
    22,17,14,19,18,13,10,9,12,26,24,23,25
    
12. 
    43, 33, 24,36,35,37,26,22,23,19,18,47,45,44,46,49,48,50
    
13. 
    25, 20,17,19,16,22,21,24,23,34,30,31,29, 38,35,36, 40,39,44,
    
14. 
    40,14,10,13,12,8,9,7,17,15,16,44,42,41,43,47
    
15. 
    18, 9,4,6,3,5,7,23,20,19,22,21,28,25,26,24
    
16. 
    17,8,3,4,2,1,5,20,18,19,25,23,27,26,22, 30,35,33,34,37
    
17. 
    18,14,16,15,17,10,13,11,8,9,7,24,22,26,25,27,
    
18. 
    36,45,40,42,41,38,37,39,19,24,16,17,15,29,25
    
19. 
    19,14,16,12,13,10,11,30, 40,35,36,33,34,31
    
20. 
    14, 24,10, 8,9,4,5,3,1,2,29,24, 26, 25,23,33,30,35,34
    

2-QISM

1. 
   Talabalar ismlari ketma-ketligidan binar daraxt hosil qilish algoritmi va dasturini tuzing.
   
2. 
   Daraxt tugunlari haqiqiy sonlar bo’lsin. Daraxt barcha tugunlarini o’rta arifmetigini hisoblash algoritmi va dasturini keltiring.
   
3. 
   Daraxt tugunlari haqiqiy sonlar bo’lsin. Yozuvi manfiy bo’lgan daraxt tugunlarini o’chiruvchi dastur tuzing.
   
4. 
   Daraxt tugunlari haqiqiy sonlar bo’lsin. Yozuvi berilgan kalit qiymatidan katta bo’lgan daraxt tugunlarini o’chiruvchi dastur tuzing.
   

5. 
   Berilgan binar daraxtning balandligini aniqlash algoritmi va dasturini keltiring.
   
6. 
   Berilgan binar daraxtning har bir juft elementi balandligini aniqlash algoritmi va dasturini keltiring.
   
7. 
   Bo’sh bo’lmagan binar daraxtning eng katta va eng kichik kalitli tugunlarini aniqlashning algoritmi va dasturini keltiring.
   
8. 
   Binar daraxtni yuqoridan pastga(preorder) ko’rik o’tkazish dasturi va algoritmini keltiring.
   
9. 
   Berilgan binar daraxtdan kalit qiymatlari kamayish tartibida joylashgan bir bog’lamli ro’yhat hosil qilish algoritmi va dasturini keltiring.
   
10. 
    Binar daraxtni Quyidan yuqoriga (postorder)ko’rik o’tkazish dasturi va algoritmini keltiring.
    
11. 
    Binar daraxtni chapdan o’ngga (inorder)ko’rik o’tkazish dasturi va algoritmini keltiring.
    

12. 
    Berilgan binar daraxtning terminal tugunlari balandliklarini aniqlash algoritmi va dasturini keltiring.
    
13. 
    Daraxt tugunlari haqiqiy sonlar bo’lsin. Daraxt barcha tugunlarini o’rta arifmetigiga teng qiymatli tugunni berilgan binar daraxtga kiritish algoritmi va dasturini keltiring.
    

14. 
    Berilgan binar daraxtdan kalitlari o’sish tartibida joylashgan bir bog’lamli ro’yhat hosil qilish algoritmi va dasturini keltiring.
    
15. 
    Binar daraxtning barcha barglari yozuvini chop etuvchi dastur ishlab chiqing.
    
16. 
    Binar daraxtning barcha oraliq tugunlari yozuvini chop etuvchi dastur ishlab chiqing.
    
17. 
    Binar daraxtning tugunlari sonini aniqlashning algoritmi va dasturini keltiring.
    
18. 
    Binar daraxtda berilgan tugungacha bo’lgan masofani aniqlashning algoritmi va dasturini keltiring.