Added Binary Search Tree Python code

Sakshi-Mallick · web-flow · commit 416e7256acfd · 2020-10-01T14:11:20.000+05:30
diff --git a/BinarySearchTree.py b/BinarySearchTree.py
@@ -0,0 +1,51 @@
+class Node:
+
+    def __init__(self, data):
+
+        self.left = None
+        self.right = None
+        self.data = data
+
+# Insert method to create nodes
+    def insert(self, data):
+
+        if self.data:
+            if data < self.data:
+                if self.left is None:
+                    self.left = Node(data)
+                else:
+                    self.left.insert(data)
+            elif data > self.data:
+                if self.right is None:
+                    self.right = Node(data)
+                else:
+                    self.right.insert(data)                                                                                                                      
+        else:
+            self.data = data
+# findval method to compare the value with nodes
+    def findval(self, lkpval):
+        if lkpval < self.data:
+            if self.left is None:
+                return str(lkpval)+" Not Found"
+            return self.left.findval(lkpval)
+        elif lkpval > self.data:
+            if self.right is None:
+                return str(lkpval)+" Not Found"
+            return self.right.findval(lkpval)
+        else:
+            print(str(self.data) + ' is found')
+# Print the tree
+    def PrintTree(self):
+        if self.left:
+            self.left.PrintTree()
+        print( self.data),
+        if self.right:
+            self.right.PrintTree()
+
+
+root = Node(12)
+root.insert(6)
+root.insert(14)
+root.insert(3)
+print(root.findval(7))
+print(root.findval(14))
