forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinary_tree.py
More file actions
62 lines (53 loc) · 1.51 KB
/
binary_tree.py
File metadata and controls
62 lines (53 loc) · 1.51 KB
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
#!/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.')