XD

Author: assaabriiii

Node.py

@@ -1,5 +1,6 @@
 import collections
 
+NodesBeenMade = 0  
 
 class Node : 
     def __init__(self , data )  :
@@ -26,25 +27,31 @@ def PrintTree(self , trav_type) :
     def preorder_tree(self , start , trav) : 
         ## ROOT > LEFT > RIGHT
         if start : 
-            trav += (str(start.data) + "__" )
+            global NodesBeenMade 
+            NodesBeenMade +=1 
+            trav += (str(start.data) + "," )
             trav = self.preorder_tree(start.left , trav) 
             trav = self.preorder_tree(start.right , trav)
         return trav 
 
     def inorder_tree(self , start , trav) : 
         ## LEFT > ROOT > RIGHT
         if start : 
+            global NodesBeenMade 
+            NodesBeenMade +=1 
             trav = self.inorder_tree(start.left , trav) 
-            trav += (str(start.data) + "__")
+            trav += (str(start.data) + ",")
             trav = self.inorder_tree(start.right , trav)
         return trav 
 
     def postorder_tree(self , start , trav)  :
         ## LEFT > RIGHT > ROOT 
         if start : 
+            global NodesBeenMade 
+            NodesBeenMade +=1 
             trav = self.postorder_tree(start.left , trav) 
             trav = self.postorder_tree(start.right , trav)
-            trav += (str(start.data) + "__")
+            trav += (str(start.data) + ",")
         return trav 
     def levelorder_tree(self , start) :
         ans = []
@@ -70,7 +77,32 @@ def levelorder_tree(self , start) :
                     queue.append(currNode.right) 
             ans.append(currList) 
         return ans
+    
+    def floors_number(self) : 
+        result = tree.PrintTree("levelorder")
+        return len(result)
+    
+    def delete_tree(self) : 
+        tree.root = None 
+        
+    def MAX_MIN(self) : 
+        result = tree.PrintTree("preorder")
+        result = result.split(",")
+        result.pop()
+        result = [int(x) for x in result ]
+        return max(result),min(result)
+    
+    def find(self , atribute) : 
+        result = tree.PrintTree("levelorder")
+        x = 0 
+        for i in result :
+            x +=1  
+            for j in i : 
+                if j == atribute : 
+                    return x
+        
 
+    
 
         """_summary_
        2
@@ -82,12 +114,31 @@ def levelorder_tree(self , start) :
    [3.4]
    [5,6]
         """
-    
+# 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 -> 0
+# 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 -> 0 
+
+
 
 tree = BinaryTree(2)   
 tree.root.left = Node(3)
 tree.root.right = Node(4)
 tree.root.left.left = Node(5)
 tree.root.left.right = Node(6)
 
-print(tree.PrintTree("levelorder"))
+
+
+
+print(tree.PrintTree("levelorder"))
+result = tree.MAX_MIN()
+print("MAX and MIN is equal to : " , result)
+x = tree.find(5)
+print("Found the desired element at the : [" , x , "] floor ")

graphical.py

@@ -0,0 +1,52 @@
+class TreeNode:
+    def __init__(self, val, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+    def __repr__(self):
+        return 'TreeNode({})'.format(self.val)
+    
+def deserialize(string):
+    if string == '{}':
+        return None
+    nodes = [None if val == 'null' else TreeNode(int(val))
+             for val in string.strip('[]{}').split(',')]
+    kids = nodes[::-1]
+    root = kids.pop()
+    for node in nodes:
+        if node:
+            if kids: node.left  = kids.pop()
+            if kids: node.right = kids.pop()
+    return root
+
+def drawtree(root):
+    def height(root):
+        return 1 + max(height(root.left), height(root.right)) if root else -1
+    def jumpto(x, y):
+        t.penup()
+        t.goto(x, y)
+        t.pendown()
+    def draw(node, x, y, dx):
+        if node:
+            t.goto(x, y)
+            jumpto(x, y-20)
+            t.write(node.val, align='center', font=('Arial', 12, 'normal'))
+            draw(node.left, x-dx, y-60, dx/2)
+            jumpto(x, y-20)
+            draw(node.right, x+dx, y-60, dx/2)
+    import turtle
+    t = turtle.Turtle()
+    t.speed(0); turtle.delay(0)
+    h = height(root)
+    jumpto(0, 30*h)
+    draw(root, 0, 30*h, 40*h)
+    t.hideturtle()
+    turtle.mainloop()
+    
+if __name__ == '__main__':
+    drawtree(deserialize('[2,5,1,7,2,3,4,5,9]'))
+    
+    
+    
+# BINARY TREE EXPLANTION
+