Hahahah

Author: assaabriiii

Node.py

@@ -159,9 +159,12 @@ def levelorder_tree(self , start) :
             ans.append(currList) 
         return ans
 
-    def floors_number(self) : 
-        result = self.PrintTree("4")
-        return len(result)
+    def floors_number(self , node) : 
+        if node is None:
+            return 0
+        left = self.floors_number(node.left)
+        right = self.floors_number(node.right)
+        return max(left, right) + 1
 
     def delete_tree(self) : 
 
@@ -172,25 +175,43 @@ def delete_tree(self) :
         """
         self.root = None 
 
-    def MAX_MIN(self) : 
+    def MAX(self) : 
+        
+        """ Max and Min in the tree : 
+        used a traversal so we can itrate 
+
+        Returns:
+            _type_: _description_
+        """
+        result = self.PrintTree("1")
+        result = result.split(",")
+        result.pop()
+        result = [int(x) for x in result ]
 
+        return max(result)
+    
+    def MIN(self) :
+         
         """ Max and Min in the tree : 
         used a traversal so we can itrate 
 
         Returns:
             _type_: _description_
         """
+        
         result = self.PrintTree("1")
         result = result.split(",")
         result.pop()
         result = [int(x) for x in result ]
 
-        return max(result),min(result)
+        return min(result)
+        
 
     def compare(self) : 
+        """ been made in the main function
+        """
         pass 
 
-    
     def draw(self) :
 
         """ Draw tree 
@@ -230,8 +251,8 @@ def search(self, node: Node , Arg: int) :
             return self.search(node.right, Arg)
 
 
-    def FullTree(node: Node) :
-        queue = []
+    def FullTree(self , node ) :
+        queue = list()
         queue.append(node)
 
         while queue != []:
@@ -245,5 +266,36 @@ def FullTree(node: Node) :
             else:
                 return False
         return True
+    
+
+    def isComplete(self):
+        def RisComplete(node: Node, index: int, nodeCount: int) :
+            if node == None:
+                return True
+            if index >= nodeCount:
+                return False
+            return RisComplete(node.left, 2 * index + 1, nodeCount) and RisComplete(node.right, 2 * index + 2, nodeCount)
 
-        
+    def get_count_of_children(self) :
+        def count_of_children(node: Node) : # recursive call
+            if (node == None):
+                return 0;
+            return (1 + count_of_children(node.left) + count_of_children(node.right))
+        return count_of_children(self.root) - 1 
+    
+    def number_of_nodes(self) : 
+        def count_nodes(node, counter=0) :
+            if node:
+                counter += 1
+                counter = count_nodes(node.right, counter)
+                counter = count_nodes(node.left, counter)
+            return counter
+
+        return count_nodes(self.root)
+    
+    def depth(self , node ) : 
+        if node is None:
+            return 0
+        left = self.floors_number(node.left)
+        right = self.floors_number(node.right)
+        return max(left, right) 

README.md

@@ -1,12 +0,0 @@
-# Graphical Binary tree using python's turtle module
-### made a binary tree -> 1 
-### node class -> 1 
-### insert method -> 1
-### NodesBeenMade for number of nodes -> 1
-### number of floors -> 1
-### how to define number of leaves -> 1
-### made the 4 method and its working  -> 1 
-### delete the tree -> 1
-### MAX and MIN in our tree -> 1 
-### full tree -> 0 
-### compare of two tree -> 1 

__pycache__/Node.cpython-310.pyc

@@ -13,7 +13,10 @@ def display_menu(menu):
     print(Fore.LIGHTBLUE_EX + "  -> " + Fore.WHITE + " Binary Tree Options " + Fore.LIGHTBLUE_EX + " <-\n\n")
 
     try : 
-        print("Main tree -> " , tree.data ,"\n\n")
+        if tree.root == None : 
+            print("tree is not defind\n\n")
+        else : 
+            print("Main tree -> " , tree.data , "\n\n")
     except :
         print("Tree is not defined\n\n")
 
@@ -24,6 +27,8 @@ def display_menu(menu):
 
 
     for k, function in menu.items():
+        if k < 10 : 
+            k = "0" + str(k)
         print(Fore.MAGENTA ,"|",k,"| -> ", Fore.YELLOW ,function.__name__)
 
 
@@ -33,6 +38,7 @@ def Binarytree():
     Nodes = []
     global tree
     select = input("Manually(1) or random(2) ? ")
+    
     if select == "1" :
         system("clear")
         while True : 
@@ -82,7 +88,7 @@ def Comparing() :
     print(Lary.data)
     input("Press Enter to compare\n")
 
-    if lary.PrintTree(str(1)) == tree.PrintTree(str(1)) : 
+    if lary.PrintTree(str(2)) == tree.PrintTree(str(2)) : 
         print("True")
     else : 
         print("False")
@@ -105,16 +111,25 @@ def Draw():
     system('clear')  # clears stdout
 
 
-def MAX_and_MIN():
+def max():
+    system("clear")
+    print("you have selected menu option max ") # Simulate function output.
+    
+    print(tree.MAX())
+    
+    input("Press Enter to Continue\n")
+    system('clear')  # clears stdout
+
+def min() : 
     system("clear")
-    print("you have selected menu option max and min") # Simulate function output.
+    print("you have selected menu option min") # Simulate function output.
 
-    print(tree.MAX_MIN())
+    print(tree.MIN())
 
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
 
-def CountLeafs() : 
+def count_leafs() : 
     system("clear")
     print("you have selected menu option count leafs") # Simulate function output.
 
@@ -123,7 +138,7 @@ def CountLeafs() :
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
 
-def DeleteTree() : 
+def delete_tree() : 
     system("clear")
     print("you have selected menu option delete tree") # Simulate function output.
 
@@ -132,11 +147,11 @@ def DeleteTree() :
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
 
-def numberOfFloors() : 
+def number_of_floors() : 
     system("clear")
     print("you have selected menu option number of floors") # Simulate function output.
 
-    print(tree.floors_number())
+    print(tree.floors_number(tree.root))
 
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
@@ -167,14 +182,50 @@ def Search() :
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
 
-def CheckForFullTree() : 
+def check_for_full_Tree() : 
     system("clear")
     print("you have selected menu option Checking for full tree ") # Simulate function output.
-    print(tree.FullTree())
+    print(tree.FullTree(tree.root))
+    
+    input("Press Enter to Continue\n")
+    system('clear')  # clears stdout
+
+def is_Complete() : 
+    system("clear")
+    print("you have selected menu option is complete tree ") # Simulate function output.
+    
+    print(tree.isComplete())
+    
+    input("Press Enter to Continue\n")
+    system('clear')  # clears stdout
+    
+def get_count_of_children() : 
+    system("clear")
+    print("you have selected menu option is count of children ") # Simulate function output.
+    
+    print(tree.get_count_of_children())
+    
+    input("Press Enter to Continue\n")
+    system('clear')  # clears stdout
+    
+def number_of_nodes() : 
+    system("clear")
+    print("you have selected menu option is count of children ") # Simulate function output.
+    
+    print(tree.number_of_nodes())
 
     input("Press Enter to Continue\n")
     system('clear')  # clears stdout
+
+def Depth() : 
+    system("clear")
+    print("you have selected menu option depth ") # Simulate function output.
 
+    print(tree.depth(tree.root))
+    
+    input("Press Enter to Continue\n")
+    system('clear')  # clears stdout
+
 def Contributors() : 
     system("clear")
     print(Fore.RESET,"\nAmirhossein Sabry 40011573\nKimia Keivanloo 40015753\n\nWWW.GEEKFORGEEKS.COM \u2764\uFE0F")
@@ -194,7 +245,7 @@ def get_word():
 def main():
     # Create a menu dictionary where the key is an integer number and the
     # value is a function name.
-    functions_names = [Binarytree,Comparing, Draw, MAX_and_MIN, CountLeafs , DeleteTree , numberOfFloors ,traversal, Search ,CheckForFullTree, Contributors ,done]
+    functions_names = [Binarytree , Comparing , Draw, max , min , count_leafs , delete_tree , number_of_floors , Depth  , traversal , Search , check_for_full_Tree , is_Complete , get_count_of_children , number_of_nodes , Contributors , done]
     menu_items = dict(enumerate(functions_names, start=1))
 
     while True: