mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Delete binary_seach_tree.py

Browse Source 
I forgot that we already have an implementation of Binary Search! So deleting this one!
This commit is contained in:
Harshil 2018-10-27 13:36:30 +02:00 committed by GitHub
parent f0af8320f7
commit e1d1f8513d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 104 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

104
data_structures/Binary Tree/binary_seach_tree.py
View File

@ -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())