From e1d1f8513dd7bd43d622bf6d24f28c49b7a21e78 Mon Sep 17 00:00:00 2001
From: Harshil <darjiharshil2994@gmail.com>
Date: Sat, 27 Oct 2018 13:36:30 +0200
Subject: [PATCH] Delete binary_seach_tree.py

I forgot that we already have an implementation of Binary Search! So deleting this one!
---
 .../Binary Tree/binary_seach_tree.py          | 104 ------------------
 1 file changed, 104 deletions(-)
 delete mode 100644 data_structures/Binary Tree/binary_seach_tree.py

diff --git a/data_structures/Binary Tree/binary_seach_tree.py b/data_structures/Binary Tree/binary_seach_tree.py
deleted file mode 100644
index 53253d23d..000000000
--- a/data_structures/Binary Tree/binary_seach_tree.py	
+++ /dev/null
@@ -1,104 +0,0 @@
-'''
-A binary search Tree
-'''
-class Node:
-
-    def __init__(self, label):
-        self.label = label
-        self.left = None
-        self.rigt = None
-
-    def getLabel(self):
-        return self.label
-
-    def setLabel(self, label):
-         self.label = label
-
-    def getLeft(self):
-        return self.left
-
-    def setLeft(self, left):
-        self.left = left
-
-    def getRight(self):
-        return self.rigt
-
-    def setRight(self, right):
-        self.rigt = right
-        
-    def sassLabel(self, label):
-         self.label = label
-
-
-class BinarySearchTree:
-
-    def __init__(self):
-        self.root = None
-
-    def insert(self, label):
-
-        #Create a new Node
-
-        node = Node(label)
-
-        if self.empty():
-            self.root = node
-        else:
-            dad_node = None
-            curr_node = self.root
-
-            while True:
-                if curr_node != None:
-
-                    dad_node = curr_node
-
-                    if node.getLabel() < curr_node.getLabel():
-                        curr_node = curr_node.getLeft()
-                    else:
-                        curr_node = curr_node.getRight()
-                else:
-                    if node.getLabel() < dad_node.getLabel():
-                        dad_node.setLeft(node)
-                    else:
-                        dad_node.setRight(node)
-                    break
-
-    def empty(self):
-        if self.root == None:
-            return True
-        return False
-
-    def preShow(self, curr_node):
-        if curr_node != None:
-            print(curr_node.getLabel(), end=" ")
-
-            self.preShow(curr_node.getLeft())
-            self.preShow(curr_node.getRight())
-
-    def getRoot(self):
-        return self.root
-
-
-'''
-Example
-            8
-           / \
-          3   10
-         / \    \
-        1   6    14
-           / \   /
-          4   7 13 
-'''
-
-t = BinarySearchTree()
-t.insert(8)
-t.insert(3)
-t.insert(1)
-t.insert(6)
-t.insert(4)
-t.insert(7)
-t.insert(10)
-t.insert(14)
-t.insert(13)
-
-t.preShow(t.getRoot())