-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjust python.py
More file actions
202 lines (201 loc) · 7.43 KB
/
just python.py
File metadata and controls
202 lines (201 loc) · 7.43 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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
from random import randint
import time
class node:
if(__name__=="__main__"):
value = 0
right = None
left = None
def insert(self,item):
current_node = self
while(True):
if(current_node==None):
current_node = item
return 1
elif(current_node.value<item.value):
if(current_node.right==None):
current_node.right = item
return 1
current_node= current_node.right
else:
if(current_node.left==None):
current_node.left = item
return 1
current_node= current_node.left
def search(self,val):
current_node = self
steps = 0
nodes_changed = 0
while(True):
if(current_node.value == val):
steps+=1
return True,steps,nodes_changed
if(current_node.value<val):
steps+=1
if(current_node.right==None):
steps+=1
return False,steps,nodes_changed
elif(current_node.right.value==val):
steps+=1
return True,steps,nodes_changed
nodes_changed+=1
current_node = current_node.right
else:
if(current_node.left==None):
steps+=1
return False,steps,nodes_changed
elif(current_node.left.value==val):
steps+=1
return True,steps,nodes_changed
nodes_changed+=1
current_node = current_node.left
class custom_node:
if(__name__=="__main__"):
value = 0
right = None
left = None
right_right = None
right_left = None
left_right = None
left_left = None
def insert(self,item):
item_value = item.value
current_node = self
while(True):
if(current_node.value > item_value ):
if(current_node.left!=None):
if(current_node.left.value>item_value):
if(current_node.left_left==None):
current_node.left_left = item
print("Added to LL of :",current_node.value)
return 1
current_node = current_node.left_left
else:
if(current_node.left_right==None):
current_node.left_right = item
print("Added to LR of :",current_node.value)
return 1
current_node = current_node.left_right;
else:
current_node.left = item
print("Added to L of :",current_node.value)
return 1
else:
if(current_node.right!=None):
if(current_node.right.value>item_value):
if(current_node.right_left==None):
current_node.right_left = item
print("Added to RL of :",current_node.value)
return 1
current_node = current_node.right_left
else:
if(current_node.right_right==None):
current_node.right_right = item
print("Added to RR of :",current_node.value)
return 1
current_node = current_node.right_right
else:
current_node.right = item
print("Added to R of :",current_node.value)
return 1
def search(self,val):
current_node = self
steps = 0
nodes_changed = 0
while(True):
if(current_node.value == val):
steps +=1
return True,steps,nodes_changed
elif(current_node.value > val):
steps +=1
if(current_node.left == None):
steps +=1
return False,steps,nodes_changed
if(current_node.left.value==val):
steps +=1
return True,steps,nodes_changed
elif(current_node.left.value > val):
steps +=1
if(current_node.left_left == None):
steps +=1
return False,steps,nodes_changed
if(current_node.left_left.value==val):
steps +=1
return True,steps,nodes_changed
steps+=1
nodes_changed+=1
current_node = current_node.left_left
else:
if(current_node.left_right == None):
steps +=1
return False,steps,nodes_changed
if(current_node.left_right.value==val):
steps +=1
return True,steps,nodes_changed
steps+=1
nodes_changed+=1
current_node = current_node.left_right
else:
if(current_node.right == None):
steps +=1
return False,steps,nodes_changed
if(current_node.right.value==val):
steps +=1
return True,steps,nodes_changed
elif(current_node.right.value > val):
steps +=1
if(current_node.right_left == None):
steps +=1
return False,steps,nodes_changed
if(current_node.right_left.value==val):
steps +=1
return True,steps,nodes_changed
steps+=1
nodes_changed+=1
current_node = current_node.right_left
else:
if(current_node.right_right == None):
steps +=1
return False,steps,nodes_changed
if(current_node.right_right.value==val):
steps +=1
return True,steps,nodes_changed
steps+=1
nodes_changed+=1
current_node = current_node.right_right
n = custom_node()
m = node()
l = [i for i in range(int(input("Number of inputs: ")))]
n.value = len(l)//2
m.value = n.value
for i in l:
t = custom_node()
r = node()
t.value = i
r.value = i
n.insert(t)
m.insert(r)
'''for i in range(len(l)):
t = custom_node()
r = node()
j = randint(0,len(l)-1)
t.value = l[j]
r.value = t.value
del l[j]
n.insert(t)
m.insert(r)'''
while(True):
temp = int(input("Enter elment to search :"))
init = time.time()
status,steps,nodes_changed = n.search(temp)
print("Status JST :",status)
print("Steps JST :",steps)
print("Nodes Changed JST :",nodes_changed)
final = time.time()
print("Difference :",final-init)
init = time.time()
status2,steps2,nodes_changed2 = m.search(temp)
print("Status BST :",status2)
print("Steps BST :",steps2)
print("Nodes Changed BST :",nodes_changed2)
final = time.time()
print("Difference :",final-init)