add data structures folder

Author: larissalages

binary_tree.py renamed to Data_Structures/binary_tree.py

@@ -0,0 +1,62 @@
+#!/bin/python3
+import time
+start = time.time()
+
+class Node:
+    def __init__(self, data):
+        self.left = None
+        self.right = None
+        self.data = data
+
+    def PrintTree(self):
+        if self.left:
+            self.left.PrintTree()
+        print(self.data)
+        if self.right:
+            self.right.PrintTree()
+
+    def insert(self, data):
+        if self.data:
+            if data < self.data:
+                if self.left is None:
+                    self.left = Node(data)
+                    return
+                else:
+                    self.left.insert(data)
+            elif data > self.data:
+                if self.right is None:
+                    self.right = Node(data)
+                    return
+                else:
+                    self.right.insert(data)
+        else:
+            self.data = data
+
+    def search_value(self, data):
+        if self.data == data:
+            print("value {} is found".format(data))
+            return
+        elif data < self.data:
+            if self.left:
+                return self.left.search_value(data)
+            else:
+                print("value {} does not exist!".format(data))
+                return
+        else:
+            if self.right:
+                return self.right.search_value(data)
+            else:
+                print("value {} does not exist!".format(data))
+                return
+
+
+root = Node(12)
+root.insert(6)
+root.insert(14)
+root.insert(3)
+root.PrintTree()
+root.search_value(18)
+
+print('Execution time:', time.time()-start, 'seconds.')
+
+ 

graph.py renamed to Data_Structures/graph.py

@@ -0,0 +1,40 @@
+class graph:
+	def __init__(self, gdict=None):
+		if gdict is None:
+			gdict =[]
+		self.gdict = gdict
+
+	def getVertices(self):
+		return list(self.gdict.keys())
+
+	def getEdges(self):
+		edges = []
+		for vtx in self.gdict:
+			for edg in self.gdict[vtx]:
+				if {vtx, edg} not in edges:
+					edges.append({vtx, edg})
+		return edges
+
+	def addVertex(self, vxt):
+		if vxt not in self.gdict:
+			self.gdict[vxt] = []
+
+	def addEdge(self, edge):
+		v1, v2 = tuple(edge)
+		if v2 not in self.gdict[v1]:
+			self.gdict[v1].append(v2)
+
+
+graph_elements = { "a" : ["b","c"],
+            "b" : ["a", "d"],
+            "c" : ["a", "d"],
+            "d" : ["e"],
+            "e" : ["d"]
+            }
+
+g = graph(graph_elements)
+
+g.addVertex('f')
+g.addEdge({'a','e'})
+print(g.getVertices())
+print(g.getEdges())