-
Notifications
You must be signed in to change notification settings - Fork 0
/
new.py
64 lines (58 loc) · 1.54 KB
/
new.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
left = [-1, -1, -1, -1, -1, -1, -1]
data = [0, 0, 0, 0, 0, 0, 0]
right = [-1, -1, -1, -1, -1, -1, -1]
fp = 0
root = 0
def banayritreeeee(val):
global fp, root
cn = root
added = False
if fp > 6:
print("Overflow occured")
elif fp == 0:
data[fp] = val
fp =+ 1
else:
data[fp] = val
while added is False:
if val < data[cn]:
if left[cn] == -1:
added = True
left[cn] = fp
else:
cn = left[cn]
elif val > data[cn]:
if right[cn] == -1:
added = True
right[cn] = fp
else:
cn = right[cn]
fp = fp + 1
def banayriSurch(value):
current = 0
isFound = False
while current != -1 and isFound is False:
if value == data[current]:
isFound = True
elif value < data[current]:
current = left[current]
elif value > data[current]:
current = right[current]
if isFound is True:
return current
else:
return -1
def trevor(root):
if root != -1:
trevor(left[root])
print(data[root])
trevor(right[root])
#MAIN
for i in range(6):
word = int(input("Enter data to enter"))
banayritreeeee(word)
x = banayriSurch(6)
print("Found at"+ str(x))
for i in range(6):
print(left[i], " ", data[i], " ", right[i])
trevor(0)