Kampyuter injeniring

O’ZBEKISTON RESPUBLIKASI RAQAMLI TEXNOLOGIYALARI VAZIRLIGI
MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNALOGIYALARI UNIVERSITETI QARSHI FILIALI

“KAMPYUTER INJENIRING “ FAKULTETI

DI-12-22 GURUH TALABASI
Asadbek Abdumannopovning
Malumotlar tuzilmasi va algaritmlari fanidan4-Amaliy ishi

TOPSHIRDI: Abdumannopov A.

TEKSHIRDI: Begulov O.

1. 
   Berilgan binar d
   

Dastur kodi:

1. 
   class TreeNode:
   
2. 
   def __init__(self, data):
   
3. 
   self.data = data
   
4. 
   self.left = None
   
5. 
   self.right = None
   

6. 
   def insert(root, name):
   
7. 
   if root is None:
   
8. 
   return TreeNode(name)
   
9. 
   
10. 
    if name < root.data:
    
11. 
    root.left = insert(root.left, name)
    
12. 
    else:
    
13. 
    root.right = insert(root.right, name)
    
14. 
    
15. 
    return root
    

16. 
    def build_binary_tree(names):
    
17. 
    root = None
    
18. 
    for name in names:
    
19. 
    root = insert(root, name)
    
20. 
    return root
    

21. 
    def in_order_traversal(root):
    
22. 
    if root:
    
23. 
    in_order_traversal(root.left)
    
24. 
    print(root.data)
    
25. 
    in_order_traversal(root.right)
    

26. 
    if __name__ == "__main__":
    
27. 
    names = ["Jo'rabei Akbarov", "Shavkat Mirziyoyev", "Alisher Usmanov", "Abduqodir Mirzayev", "Baxti tashkentskiy", "Salimboy"]
    
28. 
    
29. 
    root = build_binary_tree(names)
    
30. 
    print("Ketma-ketlikdan binar daraxt hosil qilindi:")
    
31. 
    in_order_traversal(root)
    

Dastur natijasi: