Update Binary Tree

sinanazem · sinanazem · commit e308b630b038 · 2024-06-01T22:00:48.000+03:30
diff --git a/data-structure/trees/binary_tree.py b/data-structure/trees/binary_tree.py
@@ -1,79 +1,34 @@
-class NodeTree:
-    
+class BinaryTree:
     def __init__(self, data):
         self.data = data
-        self.children = []
-        self.parent = None
-        
-    def add_child(self, new_node):
-        if type(new_node) != NodeTree:
-            new_node = NodeTree(new_node)
-        self.children.append(new_node)
-        new_node.parent = self
-        
-        
-    def get_level(self):
-        p = self.parent
-        level = 0
-        while p:
-            level += 1
-            p = p.parent
-        return level
-    
-    def print_tree(self):
-        space = '  ' * self.get_level()
-        prefix = space + "|--" if self.parent else "|--"
-        print(prefix , self.data)
-        for child in self.children:
-            child.print_tree()
-            
-    def height(self):
-        if len(self.children) == 0:
-            return 0
-        else:
-            max_height = -1
-            for child in self.children:
-                max_height = max(max_height, child.height())
-            return max_height + 1
-    
-    
-    def search(self, key):
+        self.left_child = None
+        self.right_child = None
         
-        # found
-        if self.data == key:
-            return True
+    def add_child(self, data):
+        if type(data) != BinaryTree:
+            data = BinaryTree(data)
         
-        # not found
-        else:
-            for child in self.children:
-                found = child.search(key)
-                if found:
-                    return True
-                
-            return False
+        if self.left_child == None:
+            self.left_child = data
         
+        elif self.right_child == None:
+            self.right_child = data
         
-    def isbinary(self):
-        if len(self.children) > 2:
-            return False
-        elif len(self.children) == 0:
-            return True
         else:
-            for child in self.children:
-                if not child.isbinary():
-                    return False
-                
-            return True
-        
-        
+            self.left_child.add_child(data)
+            
+
 if __name__ == "__main__":
+    root = BinaryTree(1)
+    root.add_child(5)
+    root.add_child(12)
+    root.add_child(3)
+    root.add_child(6)
+
     
-    ali = NodeTree("Ali")
-    ali.add_child("Reza")
-    ali.add_child("Hamed")
-    ali.children[0].add_child("Arad")
-    ali.children[0].add_child("Aras")
+    print(root.left_child.left_child.data)
     
-    print(ali.print_tree())
-    print(ali.isbinary())
-    print(ali.search("Ebrahim"))
+        
+            
+            
+            
diff --git a/data-structure/trees/general_tree.py b/data-structure/trees/general_tree.py
@@ -1,30 +1,32 @@
-
-
 class NodeTree:
+    
     def __init__(self, data):
         self.data = data
         self.children = []
         self.parent = None
         
-    def add_node(self, node):
-        self.children.append(node)
-        node.parent = self
+    def add_child(self, new_node):
+        if type(new_node) != NodeTree:
+            new_node = NodeTree(new_node)
+        self.children.append(new_node)
+        new_node.parent = self
         
-    def print_tree(self):
         
-        space = "\t"
-        print(space * self.get_level(), self.data)
-        for child in self.children:
-            child.print_tree()
-            
     def get_level(self):
         p = self.parent
-        lvl = 1
+        level = 0
         while p:
-            lvl +=1
+            level += 1
             p = p.parent
-        return lvl
+        return level
     
+    def print_tree(self):
+        space = '  ' * self.get_level()
+        prefix = space + "|--" if self.parent else "|--"
+        print(prefix , self.data)
+        for child in self.children:
+            child.print_tree()
+            
     def height(self):
         if len(self.children) == 0:
             return 0
@@ -33,37 +35,45 @@ def height(self):
             for child in self.children:
                 max_height = max(max_height, child.height())
             return max_height + 1
+    
+    
+    def search(self, key):
+        
+        # found
+        if self.data == key:
+            return True
+        
+        # not found
+        else:
+            for child in self.children:
+                found = child.search(key)
+                if found:
+                    return True
+                
+            return False
+        
+        
+    def isbinary(self):
+        if len(self.children) > 2:
+            return False
+        elif len(self.children) == 0:
+            return True
+        else:
+            for child in self.children:
+                if not child.isbinary():
+                    return False
+                
+            return True
         
         
 if __name__ == "__main__":
     
-    # Create a Node (root)
-    root = NodeTree("Electronics")
-    
-    # Create Children for root
-    ## first child
-    laptop = NodeTree("Laptop")
-    laptop.add_node(NodeTree("Acer"))
-    laptop.add_node(NodeTree("Asus"))
-    laptop.add_node(NodeTree("Mac"))
-    
-    root.add_node(laptop)
-    
-    ## second child   
-    phone = NodeTree("Phone")
-    phone.add_node(NodeTree("iPhone"))
-    phone.add_node(NodeTree("Samsung"))
-    phone.add_node(NodeTree("Xiaomi"))
-    
-    root.add_node(phone)
-    
-    ## third child   
-    tv = NodeTree("TV")
-    tv.add_node(NodeTree("Goldiran"))
-    tv.add_node(NodeTree("LG"))
-    tv.add_node(NodeTree("SONY"))
-    
-    root.add_node(tv)
+    ali = NodeTree("Ali")
+    ali.add_child("Reza")
+    ali.add_child("Hamed")
+    ali.children[0].add_child("Arad")
+    ali.children[0].add_child("Aras")
     
-    root.print_tree()
-    print(root.height())
+    print(ali.print_tree())
+    print(ali.isbinary())
+    print(ali.search("Ebrahim"))
