add Tree data structure :tree:

Author: EINDEX

Diff for: DataStructure/Linear/__init__.py

@@ -0,0 +1,44 @@
+class Tree(object):
+    height = None
+    weight = None
+    root = None
+
+    def __init__(self, key, children):
+        self.children = children
+        self.key = key
+        if self.root is None:
+            self.root = self
+
+    def depth(self):
+        if self.root is None:
+            return 0
+
+        def depth_func(node):
+            if len(node.children) == 0:
+                return 1
+            depth_child = []
+            for child in node.children:
+                depth_child.append(depth_func(child) + 1)
+            return max(depth_child)
+
+        return depth_func(self.root)
+
+    def print_tree(self):
+        if self.root is None:
+            print('tree is None')
+            return
+
+        def print_func(node, depth):
+            if depth == 0:
+                print('   ' * depth + str(node.key))
+            else:
+                print(' ' + '   ' * (depth - 1) + '--' + str(node.key))
+            for child in node.children:
+                print_func(child, depth + 1)
+
+        print_func(self.root, 0)
+
+
+root = Tree(1, [Tree(2, [Tree(3, [])]), Tree(4, [])])
+print(root.depth())
+root.print_tree()