add BinaryTree data structure

Author: EINDEX

DataStructure/Tree/BST.py renamed to DataStructure/tree/BST.py

@@ -1,10 +1,10 @@
 import copy
 
-from DataStructure.Tree.tree import Tree
+from DataStructure.tree.BinaryTree import BinaryTree
 
 
 # 二叉查找树
-class BST(Tree):
+class BST(BinaryTree):
     root = None
 
     def __init__(self, key, data):
@@ -14,35 +14,15 @@ def __init__(self, key, data):
         """
         self.key = key
         self.data = data
-        self._l_child = None
-        self._r_child = None
-        super().__init__(key, [self.l_child, self._r_child])
+        super().__init__(key)
 
     def __str__(self):
         return str({
             'key': str(self.key),
             'data': str(self.data)
         })
 
-    @property
-    def l_child(self):
-        return self._l_child
-
-    @l_child.setter
-    def l_child(self, l_child):
-        if not isinstance(l_child, BST): return
-        self._l_child = l_child
-        self.children = [self.l_child, self.r_child]
-
-    @property
-    def r_child(self):
-        return self._r_child
-
-    @r_child.setter
-    def r_child(self, r_child):
-        if not isinstance(r_child, BST): return
-        self._r_child = r_child
-        self.children = [self.l_child, self.r_child]
+
 
     # 再书中找到一个值
     def get(self, key):

DataStructure/tree/BinaryTree.py

@@ -0,0 +1,32 @@
+from DataStructure.tree.Tree import Tree
+
+
+class BinaryTree(Tree):
+    """
+    二叉树：基本二叉树的数据结构
+    """
+    def __init__(self, key):
+        self.key = key
+        self._r_child = None
+        self._l_child = None
+        super().__init__(key=key, children=[self._l_child, self._r_child])
+
+    @property
+    def l_child(self):
+        return self._l_child
+
+    @l_child.setter
+    def l_child(self, l_child):
+        if not isinstance(l_child, BinaryTree): return
+        self._l_child = l_child
+        self.children = [self.l_child, self.r_child]
+
+    @property
+    def r_child(self):
+        return self._r_child
+
+    @r_child.setter
+    def r_child(self, r_child):
+        if not isinstance(r_child, BinaryTree): return
+        self._r_child = r_child
+        self.children = [self.l_child, self.r_child]

DataStructure/Tree/tree.py renamed to DataStructure/tree/Tree.py

@@ -1,11 +1,14 @@
 class Tree(object):
+    """
+    树：基本树的数据结构
+    """
     height = None
     weight = None
     root = None
 
     def __init__(self, key, children):
-        self.children = children
         self.key = key
+        self.children = children
         if self.root is None:
             self.root = self
 
@@ -56,6 +59,7 @@ def inner_size(node):
 
         return inner_size(self)
 
+
 if __name__ == '__main__':
     root = Tree(1, [Tree(2, [Tree(3, [])]), Tree(4, [])])
     print(root.depth())