forked from logicheap/DataStructures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchTreeWithSearchOperation.py
64 lines (52 loc) · 1.55 KB
/
BinarySearchTreeWithSearchOperation.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
class Node:
def __init__(self, data):
self.left = None
self.right = None
self.data = data
class BinarySearchTree:
def __init__(self):
self.root = None
def inorder_traversal(self, root):
if root==None:
return
else:
self.inorder_traversal(root.left)
print(root.data)
self.inorder_traversal(root.right)
def preorder_traversal(self, root):
if root == None:
return
else:
print(root.data)
self.preorder_traversal(root.left)
self.preorder_traversal(root.right)
def postorder_traversal(self, root):
if root == None:
return
else:
self.postorder_traversal(root.left)
self.postorder_traversal(root.right)
print(root.data)
def search(self, root, value):
if root:
if root.data == value:
return root
elif root.data > value:
return self.search(root.left, value)
else:
return self.search(root.right, value)
T = BinarySearchTree()
T.root = Node(50)
T.root.left = Node(20)
T.root.right = Node(70)
T.root.left.left = Node(15)
T.root.left.right = Node(35)
T.root.right.right = Node(90)
print("Inorder traversal of tree")
T.inorder_traversal(T.root)
#calling search method of BST to find value 90
search_result = T.search(T.root, 90)
if search_result:
print("Searched value " + str(search_result.data) + " found")
else:
print("value not found")