s_id string | p_id string | u_id string | date string | language string | original_language string | filename_ext string | status string | cpu_time string | memory string | code_size string | code string | error string | stdout string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s913592298 | p02281 | u626266743 | 1511268069 | Python | Python3 | py | Runtime Error | 0 | 0 | 722 | n = int(input())
tree = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {1, r}
def preorder(i):
if (i == -1):
return
print(" {}".format(i), end = "")
preorder(left[i])
preorder(right[i])
def inorder(i):
if (i == -1):
return
inorder(left[i])
print(" {}".format(i), end = "")
inorder(right[i])
def postorder(i):
if (i == -1):
return
postorder(left[i])
postorder(right[i])
print(" {}".format(i), end = "")
print('Preorder')
preorder(root)
print()
print('Inorder')
inorder(root)
print()
print('Postorder')
postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmpa_20f71o/tmp9c1btp8v.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s138941615 | p02281 | u626266743 | 1511268125 | Python | Python3 | py | Runtime Error | 0 | 0 | 785 | n = int(input())
tree = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {1, r}
def preorder(i):
if (i == -1):
return
(l, r) = tree[i]
print(" {}".format(i), end = "")
preorder(left[i])
preorder(right[i])
def inorder(i):
if (i == -1):
return
(l, r) = tree[i]
inorder(left[i])
print(" {}".format(i), end = "")
inorder(right[i])
def postorder(i):
if (i == -1):
return
(l, r) = tree[i]
postorder(left[i])
postorder(right[i])
print(" {}".format(i), end = "")
print('Preorder')
preorder(root)
print()
print('Inorder')
inorder(root)
print()
print('Postorder')
postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmp3iksa2qw/tmppq5eta7q.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s618567103 | p02281 | u626266743 | 1511268222 | Python | Python3 | py | Runtime Error | 0 | 0 | 756 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= (1 + r)
def preorder(i):
if (i == -1):
return
print(" {}".format(i), end = "")
preorder(left[i])
preorder(right[i])
def inorder(i):
if (i == -1):
return
inorder(left[i])
print(" {}".format(i), end = "")
inorder(right[i])
def postorder(i):
if (i == -1):
return
postorder(left[i])
postorder(right[i])
print(" {}".format(i), end = "")
print('Preorder')
preorder(root)
print()
print('Inorder')
inorder(root)
print()
print('Postorder')
postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmpo1jt63f4/tmpz7_roks0.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s704750874 | p02281 | u626266743 | 1511268270 | Python | Python3 | py | Runtime Error | 0 | 0 | 756 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= (l + r)
def preorder(i):
if (i == -1):
return
print(" {}".format(i), end = "")
preorder(left[i])
preorder(right[i])
def inorder(i):
if (i == -1):
return
inorder(left[i])
print(" {}".format(i), end = "")
inorder(right[i])
def postorder(i):
if (i == -1):
return
postorder(left[i])
postorder(right[i])
print(" {}".format(i), end = "")
print('Preorder')
preorder(root)
print()
print('Inorder')
inorder(root)
print()
print('Postorder')
postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmp87u0vwuv/tmpv1qyztd9.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s157419660 | p02281 | u626266743 | 1511268337 | Python | Python3 | py | Runtime Error | 0 | 0 | 756 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= (l + r)
def Preorder(i):
if (i == -1):
return
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if (i == -1):
return
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if (i == -1):
return
Postorder(left[i])
Postorder(right[i])
print(" {}".format(i), end = "")
print("Preorder")
Preorder(root)
print()
print("Inorder")
Inorder(root)
print()
print("Postorder")
Postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmpdp0dpx4z/tmpatoczhhf.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s904397671 | p02281 | u626266743 | 1511268406 | Python | Python3 | py | Runtime Error | 0 | 0 | 756 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = sum(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= (l + r)
def Preorder(i):
if (i == -1):
return
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if (i == -1):
return
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if (i == -1):
return
Postorder(left[i])
Postorder(right[i])
print(" {}".format(i), end = "")
print("Preorder")
Preorder(root)
print()
print("Inorder")
Inorder(root)
print()
print("Postorder")
Postorder(root)
print() | Traceback (most recent call last):
File "/tmp/tmpdyxcbarl/tmpbp3oiik8.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s806470884 | p02281 | u424457654 | 1511277455 | Python | Python3 | py | Runtime Error | 0 | 0 | 694 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {l, r}
def Preorder(i):
if i == -1:
return
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if i == -1:
return
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if i == -1:
return
Postorder(left[i])
Postorder(right[i])
print("Preorder")
Preorder(root)
print()
print("Inorder")
Inorder(root)
print()
print("Postorder")
Postorder(root)
print | Traceback (most recent call last):
File "/tmp/tmpagm9vkn5/tmpkk5wjufc.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s225573518 | p02281 | u424457654 | 1511277580 | Python | Python3 | py | Runtime Error | 0 | 0 | 794 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {l, r}
def Preorder(i):
if i == -1:
return
(l, r) = tree[i]
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if i == -1:
return
(l, r) = tree[i]
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if i == -1:
return
(l, r) = tree[i]
Postorder(left[i])
Postorder(right[i])
print(" {}".format(i), end = "")
print("Preorder")
Preorder(root)
print()
print("Inorder")
Inorder(root)
print()
print("Postorder")
Postorder(root)
print | Traceback (most recent call last):
File "/tmp/tmp3a_qo3_z/tmprw2xn6d1.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s215454602 | p02281 | u424457654 | 1511277644 | Python | Python3 | py | Runtime Error | 0 | 0 | 825 | n = int(input())
left = [None for i in range(n)]
right = [None for i in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {l, r}
root_n = root.pop()
def Preorder(i):
if i == -1:
return
(l, r) = tree[i]
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if i == -1:
return
(l, r) = tree[i]
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if i == -1:
return
(l, r) = tree[i]
Postorder(left[i])
Postorder(right[i])
print(" {}".format(i), end = "")
print("Preorder")
Preorder(root_n)
print()
print("Inorder")
Inorder(root_n)
print()
print("Postorder")
Postorder(root_n)
print | Traceback (most recent call last):
File "/tmp/tmp36_tn_0_/tmp3ghp3ue5.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s281438885 | p02281 | u424457654 | 1511277859 | Python | Python3 | py | Runtime Error | 0 | 0 | 762 | n = int(input())
left = [None for _ in range(n)]
right = [None for _ in range(n)]
root = set(range(n))
for i in range(n):
i, l, r = map(int, input().split())
left[i] = l
right[i] = r
root -= {l, r}
root_n = root.pop()
def Preorder(i):
if i == -1:
return
print(" {}".format(i), end = "")
Preorder(left[i])
Preorder(right[i])
def Inorder(i):
if i == -1:
return
Inorder(left[i])
print(" {}".format(i), end = "")
Inorder(right[i])
def Postorder(i):
if i == -1:
return
Postorder(left[i])
Postorder(right[i])
print(" {}".format(i), end = "")
print("Preorder")
Preorder(root_n)
print()
print("Inorder")
Inorder(root_n)
print()
print("Postorder")
Postorder(root_n)
print | Traceback (most recent call last):
File "/tmp/tmp5wfsf4r2/tmpn4qg96wx.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s021139801 | p02281 | u150984829 | 1519145436 | Python | Python3 | py | Runtime Error | 0 | 0 | 371 | def p(u):
if u+1:print(s,u,end=s);p(T[u]);p(T[u+N])
def i(u):
if u+1:i(T[u]);print(s,u,end=s);i(T[u+N])
def o(u):
if u+1:o(T[u]);o(T[u+N]);print(s,u,end=s)
s,o='','order'
N=int(input())
T=[0,0]*N
R=set(range(N))
for _ in[0]*N:
a,b,c=map(int,input().split())
T[a],T[a+N]=b,c
R-={b,c}
r=R.pop()
print('Pre'+o)
p(r)
print('\nIn'+o)
i(r)
print('\nPost'+o)
o(r)
print()
| Traceback (most recent call last):
File "/tmp/tmpfyjwhm0t/tmpkm041dxy.py", line 8, in <module>
N=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s060925120 | p02281 | u912143677 | 1521842159 | Python | Python3 | py | Runtime Error | 0 | 0 | 795 | NIL = -1
class Node:
parent = NIL
left = NIL
right = NIL
n = int(input())
t = [Node for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
if tmp[1] != -1:
t[i].left = tmp[1]
t[tmp[1]].parent = i
if tmp[2] != -1:
t[i].right = tmp[2]
t[tmp[2]].parent = i
def preParse(u):
if u == NIL:
return
print(u)
preParse(t[u].left)
preParse(t[u].right)
def inParse(u):
if u == NIL:
return
inParse(t[u].left)
print(u)
inParse(t[u].right)
def postParse(u):
if u == NIL:
return
postParse(t[u].left)
postParse(t[u].right)
print(u)
print("Preorder")
print("", preParse(0))
print("Inorder")
print("", inParse(0))
print("Postorder")
print("", postParse(0))
| Traceback (most recent call last):
File "/tmp/tmp4quoyj1f/tmpj2cka2sc.py", line 8, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s726245600 | p02281 | u912143677 | 1521843736 | Python | Python3 | py | Runtime Error | 0 | 0 | 858 | NIL = -1
class Node:
def __init__(self):
self.parent = NIL
self.left = NIL
self.right = NIL
n = int(input())
t = [Node() for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
if tmp[1] != -1:
t[i].left = tmp[1]
t[tmp[1]].parent = i
if tmp[2] != -1:
t[i].right = tmp[2]
t[tmp[2]].parent = i
def preParse(u):
if u == NIL:
return
print("", u, end = "")
preParse(t[u].left)
preParse(t[u].right)
def inParse(u):
if u == NIL:
return
inParse(t[u].left)
print("", u, end = "")
inParse(t[u].right)
def postParse(u):
if u == NIL:
return
postParse(t[u].left)
postParse(t[u].right)
print("", u, end = "")
print("Preorder")
preParse(0)
print("Inorder")
inParse(0)
print("Postorder")
postParse(0)
| Traceback (most recent call last):
File "/tmp/tmpatojqorn/tmpilxq5knl.py", line 10, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s593563405 | p02281 | u912143677 | 1521843879 | Python | Python3 | py | Runtime Error | 0 | 0 | 878 | NIL = -1
class Node:
def __init__(self):
self.parent = NIL
self.left = NIL
self.right = NIL
n = int(input())
t = [Node() for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
if tmp[1] != -1:
t[i].left = tmp[1]
t[tmp[1]].parent = i
if tmp[2] != -1:
t[i].right = tmp[2]
t[tmp[2]].parent = i
def preParse(u):
if u == NIL:
return
print("", u, end = "")
preParse(t[u].left)
preParse(t[u].right)
def inParse(u):
if u == NIL:
return
inParse(t[u].left)
print("", u, end = "")
inParse(t[u].right)
def postParse(u):
if u == NIL:
return
postParse(t[u].left)
postParse(t[u].right)
print("", u, end = "")
print("Preorder")
preParse(0)
print("")
print("Inorder")
inParse(0)
print("")
print("Postorder")
postParse(0)
| Traceback (most recent call last):
File "/tmp/tmp2remcyg1/tmp0i_ocssg.py", line 10, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s823935385 | p02281 | u007270338 | 1529778379 | Python | Python3 | py | Runtime Error | 0 | 0 | 1562 | #coding:utf-8
N = int(input())
class Tree:
def __init__(self, ID,p=-1):
self.ID = ID
def makeTree(self, tree):
ID = tree.ID
if ID == -1:
return
else:
[ID,l,r] = trees[ID]
tree.l = Tree(l)
tree.r = Tree(r)
treeL = tree.l
treeR = tree.r
treeL.p = tree
treeR.p = tree
self.makeTree(self,treeL)
self.makeTree(self,treeR)
def preParse(tree):
ID = tree.ID
if ID == -1:
return
else:
global preList
preList.append(ID)
treeL = tree.l
treeR = tree.r
preParse(treeL)
preParse(treeR)
def inParse(tree):
ID = tree.ID
if ID == -1:
return
else:
global inList
treeL = tree.l
treeR = tree.r
inParse(treeL)
inList.append(ID)
inParse(treeR)
def posParse(tree):
ID = tree.ID
if ID == -1:
return
else:
global posList
treeL = tree.l
treeR = tree.r
posParse(treeL)
posParse(treeR)
posList.append(ID)
trees = [list(map(int,input().split())) for i in range(N)]
tree = Tree(0)
Tree.makeTree(Tree,tree)
preList = []
inList = []
posList = []
preParse(tree)
inParse(tree)
posParse(tree)
def convert(List):
return " ".join([str(num) for num in List])
a = convert(preList)
b = convert(inList)
c = convert(posList)
print("Preorder")
print(a)
print("Inorder")
print(b)
print("Postorder")
print(c)
| Traceback (most recent call last):
File "/tmp/tmp_5yh1v9x/tmp0omikmxu.py", line 2, in <module>
N = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s783945505 | p02281 | u782850731 | 1380159757 | Python | Python | py | Runtime Error | 20 | 4340 | 1452 | #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
class Node(object):
def __init__(self):
self.id = None
self.parent = -1
self.childs = None
def preorder_walk(data, index, out):
node = data[index]
out.append(node.id)
for cidx in node.childs:
if cidx >= 0:
preorder_walk(data, cidx, out)
def inorder_walk(data, index, out):
node = data[index]
for cidx in node.childs:
if cidx >= 0:
inorder_walk(data, cidx, out)
if node.id not in out:
out.append(node.id)
if node.id not in out:
out.append(node.id)
def postorder_wark(data, index, out):
node = data[index]
for cidx in node.childs:
if cidx >= 0:
postorder_wark(data, cidx, out)
out.append(node.id)
n = int(stdin.readline())
#assert 1 <= n <= 25
data = [Node() for _ in range(n)]
for _ in range(n):
idx, left, right = (int(s) for s in stdin.readline().split())
data[idx].id = idx
data[idx].childs = [left, right]
for c in data[idx].childs:
data[c].parent = idx
start = None
for node in data:
if node.parent == -1:
start = node.id
break
for name, func in (('Preorder\n', preorder_walk),
('Inorder\n', inorder_walk),
('Postorder\n', postorder_wark)):
out = []
func(data, start, out)
print(name, *out) | Traceback (most recent call last):
File "/tmp/tmptkcxmssg/tmp7o2kz_g6.py", line 40, in <module>
n = int(stdin.readline())
^^^^^^^^^^^^^^^^^^^^^
ValueError: invalid literal for int() with base 10: ''
| |
s882684352 | p02282 | u805716376 | 1556808837 | Python | Python3 | py | Runtime Error | 0 | 0 | 297 | n = int(input())
pre = list(map(int, input().split()))
ino = list(map(int, input().split()))
d = []
root = pre[1]
pre = iter(pre).__next__
def dfs(l, r):
if l >= r:
return
c = pre()
m = ino.index(c)
dfs(l, m)
dfs(m+1, r)
d += [c]
dfs(0, len(ino))
print(*c)
| Traceback (most recent call last):
File "/tmp/tmpik48rbai/tmpd9hc40uq.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s358572571 | p02282 | u805716376 | 1556808861 | Python | Python3 | py | Runtime Error | 0 | 0 | 297 | n = int(input())
pre = list(map(int, input().split()))
ino = list(map(int, input().split()))
d = []
root = pre[1]
pre = iter(pre).__next__
def dfs(l, r):
if l >= r:
return
c = pre()
m = ino.index(c)
dfs(l, m)
dfs(m+1, r)
d += [c]
dfs(0, len(ino))
print(*d)
| Traceback (most recent call last):
File "/tmp/tmp35mrr5_z/tmp6d9oxmk8.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s448542251 | p02282 | u805716376 | 1556808922 | Python | Python3 | py | Runtime Error | 20 | 5600 | 310 | n = int(input())
pre = list(map(int, input().split()))
ino = list(map(int, input().split()))
d = []
root = pre[1]
pre = iter(pre).__next__
def dfs(l, r):
global d
if l >= r:
return
c = pre()
m = ino.index(c)
dfs(l, m)
dfs(m+1, r)
d += [c]
dfs(0, len(ino))
print(*d)
| Traceback (most recent call last):
File "/tmp/tmp193xz4su/tmplzu_4lfi.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s135645222 | p02282 | u881590806 | 1469449250 | Python | Python | py | Runtime Error | 10 | 6404 | 1090 | def postorder(n,preorder,inorder):
if len(preorder) > 1:
left_inorder = []
right_inorder = []
flag = False
for i in range(len(inorder)):
if flag == False:
if n == inorder[i]:
flag = True
else:
left_inorder.append(inorder[i])
else:
right_inorder.append(inorder[i])
left_preorder = []
right_preorder = []
flag = False
for i in range(1,len(preorder)):
if flag == False:
left_preorder.append(preorder[i])
if len(left_preorder) == len(left_inorder):
flag = True
else:
right_preorder.append(preorder[i])
postorder(left_preorder[0],left_preorder,left_inorder)
postorder(right_preorder[0],right_preorder,right_inorder)
if len(preorder) >= 0:
print n,
n = int(raw_input())
preorder = map(int,raw_input().split(' '))
inorder = map(int,raw_input().split(' '))
postorder(preorder[0],preorder,inorder) | File "/tmp/tmp698eaftt/tmpb4cip9gv.py", line 27
print n,
^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s192067775 | p02282 | u159356473 | 1478849579 | Python | Python3 | py | Runtime Error | 20 | 7764 | 448 | #coding:UTF-8
def RoT(A,B,ans):
if A:
root=A[0]
rindex=B.index(root)
Aleft=A[1:rindex+1]
Aright=A[rindex+1:]
Bleft=B[:rindex]
Bright=B[rindex:]
RoT(Aleft,Bleft,ans)
RoT(Aright,Bright,ans)
ans.append(root)
if __name__=="__main__":
n=int(input())
A=input().split(" ")
B=input().split(" ")
ans=[]
RoT(A,B,ans)
print(" ".join(ans)) | Traceback (most recent call last):
File "/tmp/tmptb1p4qog/tmp7ta68s8_.py", line 19, in <module>
n=int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s234426509 | p02282 | u742013327 | 1479114641 | Python | Python3 | py | Runtime Error | 20 | 7768 | 1565 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_7_D
def postorder(binary_tree, target_index, result):
left = binary_tree[target_index]["left"]
right = binary_tree[target_index]["right"]
if not left == -1:
postorder(binary_tree, left, result)
if not right == -1:
postorder(binary_tree, right, result)
result.append(target_index)
def solve(preorder_list, inorder_list, result):
if len(inorder_list) == 1:
return inorder_list[0]
#print(result)
parent = preorder_list[0]
left_trees = inorder_list[:inorder_list.index(parent)]
right_tree_index = 1
if left_trees:
result[parent]["left"] = solve(preorder_list[1:], left_trees, result)
right_tree_index = preorder_list.index(left_trees[-1])
right_trees = inorder_list[inorder_list.index(parent) + 1:]
if right_trees:
result[parent]["right"] = solve(preorder_list[right_tree_index:], right_trees, result)
return parent
def reconstruction(preorder_list, inorder_list, node_num):
result = [{"left":-1,"right":-1} for i in range(node_num + 1)]
solve(preorder_list, inorder_list, result)
return result
def main():
node_num = int(input())
preorder_list = [int(a) for a in input().split()]
inorder_list = [int(a) for a in input().split()]
binary_tree = reconstruction(preorder_list, inorder_list, node_num)
postorder_list = []
postorder(binary_tree, preorder_list[0], postorder_list)
print(*postorder_list)
if __name__ == "__main__":
main() | Traceback (most recent call last):
File "/tmp/tmp3hlre7zi/tmp9bm57e63.py", line 47, in <module>
main()
File "/tmp/tmp3hlre7zi/tmp9bm57e63.py", line 39, in main
node_num = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s736108789 | p02282 | u742013327 | 1479115038 | Python | Python3 | py | Runtime Error | 20 | 7808 | 1594 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_7_D
def postorder(binary_tree, target_index, result):
left = binary_tree[target_index]["left"]
right = binary_tree[target_index]["right"]
if not left == -1:
postorder(binary_tree, left, result)
if not right == -1:
postorder(binary_tree, right, result)
result.append(target_index)
def solve(preorder_list, inorder_list, result):
#print(preorder_list, inorder_list)
if len(inorder_list) == 1:
return inorder_list[0]
parent = preorder_list[0]
left_trees = inorder_list[:inorder_list.index(parent)]
right_tree_index = 1
if left_trees:
result[parent]["left"] = solve(preorder_list[1:], left_trees, result)
right_tree_index = preorder_list.index(left_trees[-1]) + 1
right_trees = inorder_list[inorder_list.index(parent) + 1:]
if right_trees:
result[parent]["right"] = solve(preorder_list[right_tree_index:], right_trees, result)
return parent
def reconstruction(preorder_list, inorder_list, node_num):
result = [{"left":-1,"right":-1} for i in range(node_num + 1)]
solve(preorder_list, inorder_list, result)
return result
def main():
node_num = int(input())
preorder_list = [int(a) for a in input().split()]
inorder_list = [int(a) for a in input().split()]
binary_tree = reconstruction(preorder_list, inorder_list, node_num)
postorder_list = []
postorder(binary_tree, preorder_list[0], postorder_list)
print(*postorder_list)
if __name__ == "__main__":
main() | Traceback (most recent call last):
File "/tmp/tmph9__k1sz/tmpcb8ciptc.py", line 47, in <module>
main()
File "/tmp/tmph9__k1sz/tmpcb8ciptc.py", line 39, in main
node_num = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s573211672 | p02282 | u603049633 | 1496319124 | Python | Python3 | py | Runtime Error | 0 | 0 | 374 | #Reconstruction of the Tree
n = int(input())
pre = list(map(int,input().split()))
ino = list(map(int,input().split()))
post=[]
i = -1
def recaonstruction(l, r):
global i
if l >= r:
return
i += 1
c = pre[i]
m = ino.index(c)
reconstruction(l, m)
reconstruction(m+1, r)
post.append(c)
reconstruction(0, n)
print(" ".join(map(str,post))) | Traceback (most recent call last):
File "/tmp/tmp45hmkp5j/tmp9ef_2j7p.py", line 2, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s404319648 | p02282 | u533883485 | 1499157741 | Python | Python3 | py | Runtime Error | 0 | 0 | 658 | # coding=utf-8
from collections import deque
def reconstruction(left, right):
global pre_order
global in_order
global post_order
global n
if left > right:
return None
elif left == right:
root = pre_order.popleft()
post_order.append(root)
return None
else:
root = pre_order.popleft()
root_pos = in_order.index(root)
reconstruction(left, root_pos-1)
reconstruction(root_pos+1, right)
post_order.append(root)
n = int(input())
pre_order = deque(map(int, input().split()))
in_order = deque(map(int, input().split()))
post_order = []
reconstruction(0, n-1)
print(*post_order) | Traceback (most recent call last):
File "/tmp/tmpevbd_iu1/tmpj9w1ngzq.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s110495984 | p02282 | u533883485 | 1499157865 | Python | Python3 | py | Runtime Error | 0 | 0 | 658 | # coding=utf-8
from collections import deque
def reconstruction(left, right):
global pre_order
global in_order
global post_order
global n
if left > right:
return None
elif left == right:
root = pre_order.popleft()
post_order.append(root)
return None
else:
root = pre_order.popleft()
root_pos = in_order.index(root)
reconstruction(left, root_pos-1)
reconstruction(root_pos+1, right)
post_order.append(root)
n = int(input())
pre_order = deque(map(int, input().split()))
in_order = deque(map(int, input().split()))
post_order = []
reconstruction(0, n-1)
print(*post_order) | Traceback (most recent call last):
File "/tmp/tmpd9roaz7j/tmpkkziclp0.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s114150247 | p02282 | u193453446 | 1502171861 | Python | Python3 | py | Runtime Error | 0 | 0 | 1604 | I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def search(N, A, B, num):
""" N ??? Nodes A???Preorder?????? B???Inorder??????
??????????????????????????§??? root ??? index ????????? """
# print(A)
# print(B)
root = A[0]
ld = num
for i in range(num):
if B[i] == root:
ld = i
break
if ld > 0:
N[root][L] = search(N,A[1:ld+1],B[:ld],ld)
rt = ld + 1
if rt < num:
N[root][R] = search(N,A[rt:],B[rt:],num - rt)
return root
def getroot(A, id):
if A[id][P] > -1:
return getroot(A,A[id][P])
return A[id][I]
def preorder(N,id,A):
if id < 0:
return
A.append(id)
preorder(N,N[id][L],A)
preorder(N,N[id][R],A)
def inorder(N,id,A):
if id < 0:
return
inorder(N,N[id][L],A)
A.append(id)
inorder(N,N[id][R],A)
def postorder(N,id,A):
if id < 0:
return
postorder(N,N[id][L],A)
postorder(N,N[id][R],A)
A.append(id)
def main():
""" ????????? """
num = int(input().strip())
plist = list(map(int,input().split()))
ilist = list(map(int,input().split()))
pos = []
nodes = [[i, -1, -1, -1, -1, 0, 0] for i in range(num)]
search(nodes,plist,ilist,num)
# pre = [""]
# ino = [""]
pos = []
# preorder(nodes,plist[0],pre)
# inorder(nodes,plist[0],ino)
postorder(nodes,plist[0],pos)
# print("Preorder")
# print(" ".join(map(str,pre)))
# print("Inorder")
# print(" ".join(map(str,ino)))
# print("Postorder")
print(" ".join(map(str,pos)))
if __name__ == '__main__':
main() | Traceback (most recent call last):
File "/tmp/tmpg97p5u1c/tmpcnck5dkh.py", line 81, in <module>
main()
File "/tmp/tmpg97p5u1c/tmpcnck5dkh.py", line 57, in main
num = int(input().strip())
^^^^^^^
EOFError: EOF when reading a line
| |
s341251132 | p02282 | u193453446 | 1502175299 | Python | Python3 | py | Runtime Error | 0 | 0 | 1432 | I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def getidx(Tree,value):
idx = -1
for i in range(len(Tree)):
if Tree[i][I] == value:
idx = i
break
return idx
def search(Tree, A, B, num):
""" Tree ??? Tree A???Preorder?????? B???Inorder??????
??????????????????????????§??? root ??? index ????????? """
root = A[0]
rootidx = getidx(Tree,root)
ld = num
for i in range(num):
if B[i] == root:
ld = i
break
if ld > 0:
left,lidx = search(Tree,A[1:ld+1],B[:ld],ld)
Tree[rootidx][L] = lidx
rt = ld + 1
if rt < num:
right,ridx = search(Tree,A[rt:],B[rt:],num - rt)
Tree[rootidx][R] = ridx
return (root,rootidx)
def getroot(Tree, nidx):
pidx = Tree[nidx][P]
if pidx < 0:
return nidx
return getroot(Tree,pidx)
ef postorder(Tree, nidx, A):
if nidx < 0:
return
postorder(Tree,Tree[nidx][L],A)
postorder(Tree,Tree[nidx][R],A)
A.append(Tree[nidx][I])
def main():
""" ????????? """
num = int(input().strip())
plist = list(map(int,input().split()))
ilist = list(map(int,input().split()))
tree = []
for i in plist:
tree.append([i, -1, -1, -1, -1, 0, 0])
root,ridx = search(tree, plist, ilist, num)
pos = []
postorder(tree, ridx, pos)
print(" ".join(map(str,pos)))
if __name__ == '__main__':
main() | File "/tmp/tmpv59dk45p/tmp7kf196zl.py", line 42
ef postorder(Tree, nidx, A):
^^^^^^^^^
SyntaxError: invalid syntax
| |
s567997852 | p02282 | u024715419 | 1509957030 | Python | Python3 | py | Runtime Error | 0 | 0 | 666 | n = int(input())
tree = [None for i in range(n +1)]
list_pre = list(map(int, input().split()))
list_in = list(map(int, input().split()))
def reconstruct(tree_pre, tree_in):
if not tree_pre:
return -1
root = tree_pre[0]
idx = tree_in.index(root)
tree[root] = (reconstruct(tree_pre[1:i + 1], tree_in[:i]),
reconstruct(tree_pre[i + 1:], tree_in[i + 1:]))
return root
def post_order_search(i):
if i == -1:
return
l, r = tree[i]
for j in post_order_search(l):
yield j
for j in post_order_search(r):
yield j
yield i
solve(list_pre, list_in)
print(*postorder(list_pre[0])) | Traceback (most recent call last):
File "/tmp/tmp6kqzd531/tmpmwbvh6sk.py", line 1, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s420523179 | p02282 | u007270338 | 1529801548 | Python | Python3 | py | Runtime Error | 30 | 5604 | 394 | #coding:utf-8
N = int(input())
preList = "".join(list(input().split()))
inList = "".join(list(input().split()))
def recon(l,r):
if l >= r:
return
global pos
c = preList[pos]
index = inList.find(c)
pos += 1
recon(l,index)
recon(index+1,r)
global answer
answer.append(c)
answer = []
pos = 0
recon(0,N)
answer = " ".join(answer)
print(answer)
| Traceback (most recent call last):
File "/tmp/tmpacdlltkf/tmpcpi88s3m.py", line 2, in <module>
N = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s924136271 | p02283 | u292798607 | 1531210169 | Python | Python3 | py | Runtime Error | 0 | 0 | 1652 | %%cython
class Node:
def __init__(self,x):
self.key = x
self.left = None
self.right = None
def insert(node, x):
if node is None:
return Node(x)
elif x == node.key:
return node
elif x < node.key:
node.left = insert(node.left, x)
else:
node.right = insert(node.right, x)
return node
def preorder(node):
if node == None:
return None
l.append(node.key)
preorder(node.left)
preorder(node.right)
return l
def inorder(node):
if node == None:
return None
inorder(node.left)
l.append(node.key)
inorder(node.right)
return l
class BinaryTree:
def __init__(self):
self.root = None
def insert(self, x):
self.root = insert(self.root, x)
def output(self):
print(self.root.key)
print(self.root.left.key)
print(self.root.right.key)
l = []
tree = BinaryTree()
n = int(input())
for i in range(n):
order = list(map(str, input().split()))
if order[0] == "insert":
tree.insert(int(order[1]))
if order[0] == "print":
inorder(tree.root)
for i in range(len(l)):
if i != len(l)-1:
print(" ",end="")
print(l[i],end="")
else:
print(" ",end="")
print(l[i])
l.clear()
preorder(tree.root)
for i in range(len(l)):
if i != len(l)-1:
print(" ",end="")
print(l[i],end="")
else:
print(" ",end="")
print(l[i])
l.clear()
else:
continue
| File "/tmp/tmp0hx3c0yi/tmp_v81_34u.py", line 1
%%cython
^
SyntaxError: invalid syntax
| |
s567180540 | p02283 | u292798607 | 1531210371 | Python | Python3 | py | Runtime Error | 0 | 0 | 1148 | #include<cstdio>
#include<cstdlib>
#include<string>
#include<iostream>
using namespace std;
struct Node {
int key;
Node *right, *left, *parent;
};
Node *root,*NIL;
void insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left = NIL;
z->right = NIL;
while( x != NIL){
y = x;
if( z->key < x->key ){
x = x->left;
}else {
x = x->right;
}
}
z->parent = y;
if( y == NIL ){
root = z;
} else {
if ( z->key < y->key ){
y->left = z;
}else{
y->right = z;
}
}
}
void inorder(Node *u){
if ( u == NIL ) return;
inorder(u->left);
printf(" %d", u->key);
inorder(u->right);
}
void preorder(Node *u){
if ( u == NIL)return;
printf(" %d", u->key);
preorder(u->left);
preorder(u->right);
}
int main(){
int n,i,x;
string com;
scanf("%d",&n);
for( i = 0; i < n; i++){
cin >> com;
if(com == "insert"){
scanf("%d", &x);
insert(x);
} else if( com == "print"){
inorder(root);
printf("\n");
preorder(root);
printf("\n");
}
}
return 0;
}
| File "/tmp/tmp2lduydj_/tmpadgbpgzc.py", line 5
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s585111046 | p02283 | u292798607 | 1531265327 | Python | Python3 | py | Runtime Error | 0 | 0 | 2143 | #include<cstdio>
#include<cstdlib>
#include<string>
#include<vector>
#include<iostream>
using namespace std;
struct Node {
int key;
Node *right, *left, *parent;
};
Node *root,*NIL;
bool exist = false;
vector<bool> v;
void insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left = NIL;
z->right = NIL;
while( x != NIL){
y = x;
if( z->key < x->key ){
x = x->left;
}else {
x = x->right;
}
}
z->parent = y;
if( y == NIL ){
root = z;
} else {
if ( z->key < y->key ){
y->left = z;
}else{
y->right = z;
}
}
}
void find(Node *u,int i){
if( u == NIL){
return;
}
if( u->key == i){
exist = true;
v.push_back(true);
return;
}
if(exist == false){
find(u->left,i);
find(u->right,i);
}
}
void inorder(Node *u){
if ( u == NIL ) return;
inorder(u->left);
printf(" %d", u->key);
inorder(u->right);
}
void preorder(Node *u){
if ( u == NIL)return;
printf(" %d", u->key);
preorder(u->left);
preorder(u->right);
}
int main(){
int n,i,x;
string com;
vector<string> input;
vector<int> insert_data;
vector<int> find_data;
scanf("%d",&n);
for(i = 0; i < n; i++){
cin >> com;
if(com == "insert"){
input.push_back("insert");
scanf("%d", &x);
insert_data.push_back(x);
} else if( com == "print"){
input.push_back("print");
}else if( com == "find"){
input.push_back("find");
scanf("%d", &x);
find_data.push_back(x);
}
}
int num = input.size();
for(i = 0;i < num; i++){
if(input[i] == "insert"){
insert(insert_data[0]);
insert_data.erase(insert_data.begin());
}
if(input[i] == "print"){
for(auto i: v){
if(i == true)printf("yes\n");
else printf("no\n");
}
inorder(root);
printf("\n");
preorder(root);
printf("\n");
}
if(input[i] == "find"){
exist = false;
find(root,find_data[0]);
find_data.erase(find_data.begin());
if(exist == false)v.push_back(false);
}
}
return 0;
}
| File "/tmp/tmpbau7wdci/tmp605o33h_.py", line 6
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s674206974 | p02283 | u269568674 | 1531739569 | Python | Python3 | py | Runtime Error | 0 | 0 | 1253 | class binaryTree:
def __init__(self,key,p=None,l=None,r=None):
self.key = key
self.p = p
self.l = l
self.r = r
N = int(input())
treelist = [list(input().split()) for i in range(N)]
root = None
def inorder(root):
x = root
if x == None:
return
inorder(x.l)
global inlist
inlist.append(x.key)
inorder(x.r)
def insert(root,z):
y = None
x = root
while x != None:
y = x
if z.key < x.key:
x = x.l
else:
x = x.r
z.p = y
if y == None:
root = z
elif z.key < y.key:
y.l = z
else:
y.r = z
return root
def outorder(root):
x = root
if x == None:
return
global outlist
outlist.append(x.key)
outorder(x.l)
outorder(x.r)
for data in treelist:
if data[0] == "insert":
z = binaryTree(int(data[1]))
root = insert(root,z)
if data[0] == "print":
inlist = []
outlist = []
inorder(root)
indata = " " + " ".join([str(num) for num in inlist])
print(indata)
outorder(root)
outdata = " " + " ".join([str(num) for num in outist])
print(outdata)
| Traceback (most recent call last):
File "/tmp/tmpd2jcy8go/tmprvg3han5.py", line 8, in <module>
N = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s283594810 | p02283 | u798803522 | 1540187163 | Python | Python3 | py | Runtime Error | 0 | 0 | 1945 |
from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringIO()
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
root = self.root
temp = None
while True:
temp = root
if key > root.key:
root = root.right
if root is None:
temp.right = self.Node(key)
break
else:
root = root.left
if root is None:
temp.left = self.Node(key)
break
def ini_print_inorder(self):
self.output = StringIO()
self.print_inorder(self.root)
return self.output.getvalue()
def ini_print_preorder(self):
self.output = StringIO()
self.print_preorder(self.root)
return self.output.getvalue()
def print_inorder(self, node):
if node is not None:
self.print_inorder(node.left)
print(node.key, end = " ", file = self.output)
self.print_inorder(node.right)
def print_preorder(self, node):
if node is not None:
print(node.key, end = " ", file = self.output)
self.print_preorder(node.left)
self.print_preorder(node.right)
def test_insert(self, keys):
for k in keys:
self.insert(k)
b = BinaryTree()
for _ in range(length):
comm = input()
if comm[0] == "i":
com, num = comm.split(" ")
b.insert(int(num))
else:
print(" ", end = "")
print((b.ini_print_inorder())[:-1])
print(b.ini_print_preorder()[:-1])
| Traceback (most recent call last):
File "/tmp/tmptdt7yev_/tmpvsfc75lw.py", line 64, in <module>
for _ in range(length):
^^^^^^
NameError: name 'length' is not defined
| |
s800103695 | p02283 | u798803522 | 1540187319 | Python | Python3 | py | Runtime Error | 0 | 0 | 2003 | class BinaryTree:
from io import StringIO
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringIO()
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
root = self.root
temp = None
while True:
temp = root
if key > root.key:
root = root.right
if root is None:
temp.right = self.Node(key)
break
else:
root = root.left
if root is None:
temp.left = self.Node(key)
break
def ini_print_inorder(self):
self.output = StringIO()
self.print_inorder(self.root)
return self.output.getvalue()
def ini_print_preorder(self):
self.output = StringIO()
self.print_preorder(self.root)
return self.output.getvalue()
def print_inorder(self, node):
if node is not None:
self.print_inorder(node.left)
print(node.key, end = " ", file = self.output)
self.print_inorder(node.right)
def print_preorder(self, node):
if node is not None:
print(node.key, end = " ", file = self.output)
self.print_preorder(node.left)
self.print_preorder(node.right)
def test_insert(self, keys):
for k in keys:
self.insert(k)
length = int(input())
b = BinaryTree()
for _ in range(length):
comm = input()
if comm[0] == "i":
com, num = comm.split(" ")
b.insert(int(num))
else:
print(" ", end = "")
print((b.ini_print_inorder())[:-1])
print(" ", end = "")
print(b.ini_print_preorder()[:-1])
| Traceback (most recent call last):
File "/tmp/tmpgky3e0rw/tmp_rdvh839.py", line 62, in <module>
length = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s014652690 | p02283 | u677096240 | 1546310854 | Python | Python3 | py | Runtime Error | 20 | 5612 | 1694 | class Node:
key = None
left = None
right = None
def __init__(self, k):
self.key = k
class BST:
root = None
def insert(self, k):
x = self.root
y = None
z = Node(k)
while x is not None:
y = x
if z.key < y.key:
x = x.left
elif y.key < z.key:
x = x.right
if y is None:
# 初回値
self.root = z
else:
if z.key < y.key:
y.left = z
elif y.key < z.key:
y.right = z
def inorder(self):
# 中間巡回順で出力
# 単純にソートでいいのでは
return sorted(self.preorder())
def preorder(self):
# 先行巡回順で出力
res = []
cur_node = self.root
right_successor = []
left_successor = []
# 現在の木がなにもない場合
if cur_node is None:
return res
# そうでない場合
while cur_node is not None:
res.append(cur_node.key)
# 次に調べるやつを追加する
if cur_node.left is not None:
left_successor.append(cur_node.left)
if cur_node.right is not None:
right_successor.append(cur_node.right)
# 次に調べるやつを左、右の順でやっていく
cur_node = left_successor.pop() if len(left_successor) > 0 else right_successor.pop() if len(right_successor) else None
return res
n = int(input())
bst = BST()
for _ in range(n):
query = [int(x) if x.isnumeric() else x for x in input().split()]
if query[0] == 'insert':
bst.insert(query[1])
elif query[0] == 'print':
ans = bst.inorder()
print(" " + " ".join(list(map(str, ans))))
ans = bst.preorder()
print(" " + " ".join(list(map(str, ans))))
| Traceback (most recent call last):
File "/tmp/tmp9z70n74h/tmpr48be1fa.py", line 55, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s818826327 | p02283 | u677096240 | 1546317825 | Python | Python3 | py | Runtime Error | 0 | 0 | 1155 | import re
class Node:
key = None
left = None
right = None
def __init__(self, k):
self.key = k
class BST:
root = None
def insert(self, k):
x = self.root
y = None
z = Node(k)
while x is not None:
y = x
if z.key < y.key:
x = x.left
elif y.key < z.key:
x = x.right
if y is None:
# 初回値
self.root = z
else:
if z.key < y.key:
y.left = z
elif y.key < z.key:
y.right = z
def inorder(self, r):
# 中間巡回順で出力
if r != None:
self.inorder(r.left)
print(" {}".format(r.key), end="")
self.inorder(r.right)
def preorder(self, r):
# 先行巡回順で出力
if r != None:
print(" {}".format(r.key), end="")
self.preorder(r.left)
self.preorder(r.right)
n = int(input())
bst = BST()
for _ in range(n):
# query = [int(x) if re.match('[+|-]?\d', x) else x for x in input().split()]
if query[0] == 'insert':
bst.insert(int(query[1]))
elif query[0] == 'print':
root = bst.root
bst.inorder(root)
print()
bst.preorder(root)
print()
| Traceback (most recent call last):
File "/tmp/tmprpa0_eqn/tmptpzoelon.py", line 48, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s681834371 | p02283 | u805716376 | 1551268608 | Python | Python3 | py | Runtime Error | 0 | 0 | 789 | import copy
def selection_sort(A,n):
for i in range(n):
minj = i
for j in range(i,n):
if A[j] < A[minj]:
minj = j
A[i],A[minj] = A[minj], A[i]
return A
n = int(input())
r = [0]*n
for i in range(n):
r[i] = input().split()
for i in range(n):
if r[i][0] == "insert":
root= int(r[i][1])
key = i + 1
break
left = []
right = []
for i in range(key, n):
if r[i][0] == "insert" and int(r[i][1]) < root:
left += [int(r[i][1])]
elif r[i][0] == "insert" and int(r[i][1]) > root:
right += [int(r[i][1])]
else:
pre = [root]+ left + right
a = copy.deepcopy(pre)
print(" " + *selection_sort(a,len(a)))
print(" " + *pre)
| File "/tmp/tmp1ptxqezh/tmp0rxh3grz.py", line 34
print(" " + *selection_sort(a,len(a)))
^
SyntaxError: invalid syntax
| |
s664363594 | p02283 | u805716376 | 1551281201 | Python | Python3 | py | Runtime Error | 0 | 0 | 827 | import copy
def selection_sort(A,n):
for i in range(n):
minj = i
for j in range(i,n):
if A[j] < A[minj]:
minj = j
A[i],A[minj] = A[minj], A[i]
return A
n = int(input())
r = [0]*n
for i in range(n):
r[i] = input().split()
for i in range(n):
if r[i][0] == "insert":
root= int(r[i][1])
key = i + 1
break
else:
print()
print()
left = []
right = []
for i in range(key, n):
if r[i][0] == "insert" and int(r[i][1]) < root:
left += [int(r[i][1])]
elif r[i][0] == "insert" and int(r[i][1]) > root:
right += [int(r[i][1])]
elif r
pre = [root]+ left + right
a = copy.deepcopy(pre)
print(pre)
print("", *selection_sort(a,len(a)))
print("", *pre)
| File "/tmp/tmpbsowutp5/tmpvpxavgn4.py", line 33
elif r
^
SyntaxError: expected ':'
| |
s072390015 | p02283 | u799595944 | 1556582846 | Python | Python3 | py | Runtime Error | 0 | 0 | 1982 | class Node():
def __init__(self,id,value):
self.id = id
self.child = [None,None]
self.parent = -1
self.value = value
def addChild(self,child):
self.child = child
def setParent(self,parent):
self.parent = parent
nodes = {}
def movePreorder(nodes,order,startNode):
order.append(startNode.value)
if startNode.child == [None,None]:
return
else:
for i in startNode.child:
movePreorder(nodes,order,i)
def moveInorder(nodes,inorder,startNode):
if startNode.child == [None,None]:
inorder.append(startNode.value)
elif len(startNode.child) == 2:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
moveInorder(nodes,inorder,startNode.child[1])
elif len(startNode.child) == 1:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
n = int(input())
for i in range(n):
line = input().split(" ")
command = line[0]
if command == "print":
order = []
kingNode = nodes[0]
inorder = []
moveInorder(nodes,inorder,kingNode)
ans1 = ' '.join(map(str,inorder))
print(' ' + ans1)
movePreorder(nodes,order,kingNode)
ans2 = ' '.join(map(str,order))
print(' ' + ans2)
else:
value = int(line[1])
if nodes == {}:
nodes[0] = Node(0,value)
else:
start = nodes[0]
while 1:
if value <= start.value:
if start.child[0] == None:
start.child[0] = Node(2,value)
break
else:
start = start.child[0]
else:
if start.child[1] == None:
start.child[1] = Node(2,value)
break
else:
start = start.child[1]
| Traceback (most recent call last):
File "/tmp/tmpq12ipe3b/tmpo_apykfq.py", line 35, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s359816870 | p02283 | u799595944 | 1556582884 | Python | Python3 | py | Runtime Error | 0 | 0 | 1982 | class Node():
def __init__(self,id,value):
self.id = id
self.child = [None,None]
self.parent = -1
self.value = value
def addChild(self,child):
self.child = child
def setParent(self,parent):
self.parent = parent
nodes = {}
def movePreorder(nodes,order,startNode):
order.append(startNode.value)
if startNode.child == [None,None]:
return
else:
for i in startNode.child:
movePreorder(nodes,order,i)
def moveInorder(nodes,inorder,startNode):
if startNode.child == [None,None]:
inorder.append(startNode.value)
elif len(startNode.child) == 2:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
moveInorder(nodes,inorder,startNode.child[1])
elif len(startNode.child) == 1:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
n = int(input())
for i in range(n):
line = input().split(" ")
command = line[0]
if command == "print":
order = []
kingNode = nodes[0]
inorder = []
moveInorder(nodes,inorder,kingNode)
ans1 = ' '.join(map(str,inorder))
print(' ' + ans1)
movePreorder(nodes,order,kingNode)
ans2 = ' '.join(map(str,order))
print(' ' + ans2)
else:
value = int(line[1])
if nodes == {}:
nodes[0] = Node(0,value)
else:
start = nodes[0]
while 1:
if value <= start.value:
if start.child[0] == None:
start.child[0] = Node(2,value)
break
else:
start = start.child[0]
else:
if start.child[1] == None:
start.child[1] = Node(2,value)
break
else:
start = start.child[1]
| Traceback (most recent call last):
File "/tmp/tmp50yfm502/tmp0vl7bia0.py", line 35, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s563939583 | p02283 | u799595944 | 1556583039 | Python | Python3 | py | Runtime Error | 0 | 0 | 1976 | class Node():
def __init__(self,id,value):
self.id = id
self.child = [None,None]
self.parent = -1
self.value = value
def addChild(self,child):
self.child = child
def setParent(self,parent):
self.parent = parent
nodes = {}
def movePreorder(nodes,order,startNode):
order.append(startNode.value)
if startNode.child == [None,None]:
return
else:
for i in startNode.child:
movePreorder(nodes,order,i)
def moveInorder(nodes,inorder,startNode):
if startNode.child == [None,None]:
inorder.append(startNode.value)
elif len(startNode.child) == 2:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
moveInorder(nodes,inorder,startNode.child[1])
elif len(startNode.child) == 1:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
n = int(input())
for i in range(n):
line = input().split(" ")
command = line[0]
if command == "print":
order = []
kingNode = nodes[0]
inorder = []
moveInorder(nodes,inorder,kingNode)
ans1 = ' '.join(map(str,inorder))
print(' ' + ans1)
movePreorder(nodes,order,kingNode)
ans2 = ' '.join(map(str,order))
print(ans2)
else:
value = int(line[1])
if nodes == {}:
nodes[0] = Node(0,value)
else:
start = nodes[0]
while 1:
if value <= start.value:
if start.child[0] == None:
start.child[0] = Node(2,value)
break
else:
start = start.child[0]
else:
if start.child[1] == None:
start.child[1] = Node(2,value)
break
else:
start = start.child[1]
| Traceback (most recent call last):
File "/tmp/tmpfstw55lb/tmpji2dsit9.py", line 35, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s386802803 | p02283 | u799595944 | 1556583102 | Python | Python3 | py | Runtime Error | 0 | 0 | 1976 | class Node():
def __init__(self,id,value):
self.id = id
self.child = [None,None]
self.parent = -1
self.value = value
def addChild(self,child):
self.child = child
def setParent(self,parent):
self.parent = parent
nodes = {}
def movePreorder(nodes,order,startNode):
order.append(startNode.value)
if startNode.child == [None,None]:
return
else:
for i in startNode.child:
movePreorder(nodes,order,i)
def moveInorder(nodes,inorder,startNode):
if startNode.child == [None,None]:
inorder.append(startNode.value)
elif len(startNode.child) == 2:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
moveInorder(nodes,inorder,startNode.child[1])
elif len(startNode.child) == 1:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
n = int(input())
for i in range(n):
line = input().split(" ")
command = line[0]
if command == "print":
order = []
kingNode = nodes[0]
inorder = []
moveInorder(nodes,inorder,kingNode)
ans1 = ' '.join(map(str,inorder))
print(ans1)
movePreorder(nodes,order,kingNode)
ans2 = ' '.join(map(str,order))
print(' ' + ans2)
else:
value = int(line[1])
if nodes == {}:
nodes[0] = Node(0,value)
else:
start = nodes[0]
while 1:
if value <= start.value:
if start.child[0] == None:
start.child[0] = Node(2,value)
break
else:
start = start.child[0]
else:
if start.child[1] == None:
start.child[1] = Node(2,value)
break
else:
start = start.child[1]
| Traceback (most recent call last):
File "/tmp/tmptacgrmy0/tmp4ne4j2f7.py", line 35, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s812904803 | p02283 | u805716376 | 1556850686 | Python | Python3 | py | Runtime Error | 0 | 0 | 750 | class Node():
def __init__(self, key):
self.key = key
self.left = self.right = None
def insert(key):
global root
x = root
y = None
while x:x, y = x.left if key < x.key else x.right , x
if y == None:root = Node(key)
elif y.key < key:y.right = Node(key)
else:y.left = Node(key)
def pre(node):
if node == None:return
print('',node.key, end = '');pre(node.left);pre(node.right)
def ino(node):
if node == None:return
ino(node.left);print('',node.key,end='');ino(node.right)
n = int(input())
root = None
for j in range(n):
s, *i = input().split()
if s[0] == 'i':insert(int(i[0]))
else:
ino(root);print('');pre(root)print()
| File "/tmp/tmp3_gtjrp_/tmp52zt872r.py", line 32
ino(root);print('');pre(root)print()
^^^^^
SyntaxError: invalid syntax
| |
s620438108 | p02283 | u799595944 | 1558995089 | Python | Python3 | py | Runtime Error | 0 | 0 | 1976 | class Node():
def __init__(self,id,value):
self.id = id
self.child = [None,None]
self.parent = -1
self.value = value
def addChild(self,child):
self.child = child
def setParent(self,parent):
self.parent = parent
nodes = {}
def movePreorder(nodes,order,startNode):
order.append(startNode.value)
if startNode.child == [None,None]:
return
else:
for i in startNode.child:
movePreorder(nodes,order,i)
def moveInorder(nodes,inorder,startNode):
if startNode.child == [None,None]:
inorder.append(startNode.value)
elif len(startNode.child) == 2:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
moveInorder(nodes,inorder,startNode.child[1])
elif len(startNode.child) == 1:
moveInorder(nodes,inorder,startNode.child[0])
inorder.append(startNode.value)
n = int(input())
for i in range(n):
line = input().split(" ")
command = line[0]
if command == "print":
order = []
kingNode = nodes[0]
inorder = []
moveInorder(nodes,inorder,kingNode)
ans1 = ' '.join(map(str,inorder))
print(ans1)
movePreorder(nodes,order,kingNode)
ans2 = ' '.join(map(str,order))
print(' ' + ans2)
else:
value = int(line[1])
if nodes == {}:
nodes[0] = Node(0,value)
else:
start = nodes[0]
while 1:
if value <= start.value:
if start.child[0] == None:
start.child[0] = Node(2,value)
break
else:
start = start.child[0]
else:
if start.child[1] == None:
start.child[1] = Node(2,value)
break
else:
start = start.child[1]
| Traceback (most recent call last):
File "/tmp/tmp31716wmr/tmprer7n1qe.py", line 35, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s807323550 | p02283 | u284474275 | 1424399495 | Python | Python | py | Runtime Error | 0 | 0 | 1221 | import sys
class TreeNode:
def __init__(self, val):
self.val = val
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, node):
def helper(root):
if root is None:
root = node
elif node.val < root.val:
lr = helper(root.left)
root.left = lr
else:
rr = helper(root.right)
root.right = rr
return root
self.root = helper(self.root)
def inorder(self):
def helper(root):
if root is None:
return []
else:
return helper(root.left) + [root.val] + helper(root.right)
return helper(self.root)
if __name__ == '__main__':
q = sys.stdin.readline()
q = int(q)
bst = BST()
for i in range(q):
tmp = sys.stdin.readline()
if tmp.startswith('print'):
print ' '.join(map(lambda x: str(x), bst.inorder()))
else:
_, val = tmp.split()
node = TreeNode(int(val))
sys.stdout.write(' '.join(map(lambda x: str(x), bst.insert(node)) + '\n')) | File "/tmp/tmpb4dajetu/tmp0i4oofqr.py", line 41
print ' '.join(map(lambda x: str(x), bst.inorder()))
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s029665875 | p02283 | u024599888 | 1433055076 | Python | Python | py | Runtime Error | 0 | 0 | 1366 | import sys
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print('', node.key, end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startwith('i')):
n = Node(int(cmd[:7]))
T = insert(T, n)
else:
inorder_walk(T)
preorder_walk(T) | File "/tmp/tmph76p6tp7/tmpvjbqeyss.py", line 26
y.left = z
TabError: inconsistent use of tabs and spaces in indentation
| |
s377854157 | p02283 | u024599888 | 1433055937 | Python | Python3 | py | Runtime Error | 0 | 0 | 1437 | import sys
#run by python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmpyioh4zvt/tmpng4plzqb.py", line 7
self.key = key
TabError: inconsistent use of tabs and spaces in indentation
| |
s198270470 | p02283 | u024599888 | 1433056224 | Python | Python3 | py | Runtime Error | 0 | 0 | 1138 | import sys
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z):
y = None
x = T
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmp678yjbj3/tmpefrzyyeb.py", line 5
self.key = key
TabError: inconsistent use of tabs and spaces in indentation
| |
s772735416 | p02283 | u024599888 | 1433056388 | Python | Python3 | py | Runtime Error | 0 | 0 | 391 |
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmp1q0xslip/tmpyqikx_bw.py", line 7
preorder_walk(node.right)
TabError: inconsistent use of tabs and spaces in indentation
| |
s560710215 | p02283 | u024599888 | 1433056399 | Python | Python | py | Runtime Error | 0 | 0 | 391 |
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmpihym4rzc/tmpc16l48f3.py", line 7
preorder_walk(node.right)
TabError: inconsistent use of tabs and spaces in indentation
| |
s604133085 | p02283 | u024599888 | 1433056831 | Python | Python | py | Runtime Error | 0 | 0 | 1606 | #!/usr/bin/env python3
import sys
#run by python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmplj2l2t7i/tmp2dixsjfw.py", line 48
preorder_walk(node.right)
TabError: inconsistent use of tabs and spaces in indentation
| |
s078880866 | p02283 | u024599888 | 1433056890 | Python | Python3 | py | Runtime Error | 0 | 0 | 1682 | #!/usr/bin/env python3
import sys
#run by python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
if __name__ == '__main__':
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmps58eeo90/tmpyaoqifa0.py", line 41
inorder_walk(node.right)
TabError: inconsistent use of tabs and spaces in indentation
| |
s950798353 | p02283 | u024599888 | 1433057080 | Python | Python3 | py | Runtime Error | 0 | 0 | 654 | def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
if __name__ == '__main__':
T = None
num = int(sys.stdin.readline())
for _ in range(num):
cmd = sys.stdin.readline()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmpynbcmo_y/tmp0hp2cay5.py", line 6
inorder_walk(node.right)
TabError: inconsistent use of tabs and spaces in indentation
| |
s549836942 | p02283 | u024599888 | 1433057142 | Python | Python3 | py | Runtime Error | 0 | 0 | 1743 | File Edit Options Buffers Tools Python Help
#!/usr/bin/env python3
#run by python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
if __name__ == '__main__':
T = None
num = int(input())
for _ in range(num):
cmd = input()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmp4rjuts0p/tmpx4pycbt_.py", line 1
File Edit Options Buffers Tools Python Help
^^^^
SyntaxError: invalid syntax
| |
s186825785 | p02283 | u024599888 | 1433057157 | Python | Python3 | py | Runtime Error | 0 | 0 | 1651 | #!/usr/bin/env python3
#run by python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z): #z is node which you would like to insert
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
if __name__ == '__main__':
T = None
num = int(input())
for _ in range(num):
cmd = input()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmp0no1hdu0/tmpsjywo_9w.py", line 25
T = z
TabError: inconsistent use of tabs and spaces in indentation
| |
s057807890 | p02283 | u024599888 | 1433057205 | Python | Python3 | py | Runtime Error | 0 | 0 | 1497 | #!/usr/bin/env python3
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
def insert(T, z):
#initialization
y = None #parent of x
x = T
#search
while(x!=None):
y = x
if(z.key < x.key):
x = x.left
else:
x = x.right
#insert
if(y==None):
T = z
elif(z.key < y.key):
y.left = z
else:
y.right = z
return T
def inorder_walk(node):
if node.left:
inorder_walk(node.left)
print ('', node.key, end='')
if node.right:
inorder_walk(node.right)
def preorder_walk(node):
print ('', node.key,end='')
if node.left:
preorder_walk(node.left)
if node.right:
preorder_walk(node.right)
if __name__ == '__main__':
T = None
num = int(input())
for _ in range(num):
cmd = input()
if(cmd.startswith('i')):
n = Node(int(cmd[7:]))
T = insert(T, n)
else:
inorder_walk(T)
print()
preorder_walk(T)
print() | File "/tmp/tmpajeisx4v/tmp3idzmyhr.py", line 24
T = z
TabError: inconsistent use of tabs and spaces in indentation
| |
s644916446 | p02283 | u567281053 | 1460795103 | Python | Python | py | Runtime Error | 0 | 0 | 1387 | import sys
class binarySearchTree:
def __init__(self):
self.root = None
def insert(self, key):
z = Node(key)
y = None
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
if y is None:
self.root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def printBT(self):
print self.root.inorderTreeWalk()
print self.root.preorderTreeWalk()
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
def inorderTreeWalk(self):
ret = ""
if self.left:
ret += self.left.inorderTreeWalk()
ret += " " + str(self.key)
if self.right:
ret += self.right.inorderTreeWalk()
return ret
def preorderTreeWalk(self):
ret = " " + str(self.key)
if self.left:
ret += self.left.preorderTreeWalk()
if self.right:
ret += self.right.preorderTreeWalk()
return ret
if __name__ == "__main__":
lines = sys.stdin.readlines()
del lines[0]
bt = binarySearchTree()
for line in lines:
if line[0] == "i":
bt.insert(int(line.split()[1])
else:
bt.printBT() | File "/tmp/tmp7vgpzjux/tmpckxspl24.py", line 26
print self.root.inorderTreeWalk()
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s312998993 | p02283 | u567281053 | 1460796549 | Python | Python | py | Runtime Error | 0 | 0 | 1227 | import sys
class binarySearchTree:
def __init__(self):
self.root = None
def insert(self, key):
z = Node(key)
y = None
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
if y is None:
self.root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def printBT(self):
print inorderTreeWalk(self.root)
print preorderTreeWalk(self.root)
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
def inorderTreeWalk(node):
if node:
return inorderTreeWalk(node.left) + " " + str(node.key) + inorderTreeWalk(node.right)
return ""
def preorderTreeWalk(node):
if node:
return " " + str(node.key) + preorderTreeWalk(node.left) + preorderTreeWalk(node.right)
return ""
if __name__ == "__main__":
m = int(raw_input())
bt = binarySearchTree()
for i in range(m):
line = map(str, raw_input())
if line[0] == "i":
bt.insert(int(line[i].split()[1]))
else:
bt.printBT() | File "/tmp/tmp451zlx6l/tmp7f9a48lc.py", line 26
print inorderTreeWalk(self.root)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s127188054 | p02283 | u567281053 | 1460817958 | Python | Python | py | Runtime Error | 0 | 0 | 1035 | import sys
import time
class Node:
def __init__(self, key = None):
self.key = key
self.left = None
self.right = None
def insert(key):
global root
z = Node(key)
y = None
x = root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
if y is None:
root.key = key
elif z.key < y.key:
y.left = z
else:
y.right = z
def inorderTreeWalk(node):
if node:
return inorderTreeWalk(node.left) + " " + str(node.key) + inorderTreeWalk(node.right)
return ""
def preorderTreeWalk(node):
if node:
return " " + str(node.key) + preorderTreeWalk(node.left) + preorderTreeWalk(node.right)
return ""
if __name__ == "__main__":
lines = sys.stdin.readlines()
del lines[0]
root = None
for line in lines:
if line[0] == "i":
insert(int(line.split()[1]))
else:
print inorderTreeWalk(root)
print preorderTreeWalk(root) | File "/tmp/tmpzmlso6k7/tmpw_r118bi.py", line 48
print inorderTreeWalk(root)
^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s103629490 | p02283 | u567281053 | 1460818919 | Python | Python | py | Runtime Error | 0 | 0 | 1202 | import sys
import time
class Node:
def __init__(self, key):
self.key = key
self.parent = None
self.left = None
self.right = None
def insert(key, z):
global root
y = None
x = root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y is None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def inorderTreeWalk(node):
global In
if node:
inorderTreeWalk(node.left)
In.append(str(node.key))
inorderTreeWalk(node.right)
def preorderTreeWalk(node):
global Pre
if node:
Pre.append(str(node.key))
preorderTreeWalk(node.left)
preorderTreeWalk(node.right)
if __name__ == "__main__":
lines = sys.stdin.readlines()
del lines[0]
root = None
for line in lines:
if line[0] == "i":
insert(Node(int(line.split()[1])))
else:
In = []
Pre = []
inorderTreeWalk(root)
print " " + " ".join(map(str, In))
preorderTreeWalk(root)
print " " + " ".join(map(str, Pre)) | File "/tmp/tmp1ts13kzt/tmpitkr5hzo.py", line 55
print " " + " ".join(map(str, In))
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s202071722 | p02283 | u742013327 | 1480313827 | Python | Python3 | py | Runtime Error | 40 | 7744 | 1382 | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_8_A
#????????????
def insert(root, insert_node):
focus_node = root
parent = None
while not focus_node == None:
parent = focus_node
if focus_node["data"] > insert_node["data"]:
focus_node = focus_node["left"]
else:
focus_node = focus_node["right"]
if parent["data"] > insert_node["data"]:
parent["left"] = insert_node
else:
parent["right"] = insert_node
def get_preorder(node):
if node == None:
return []
r = []
r.append(str(node["data"]))
r.extend(get_preorder(node["left"]))
r.extend(get_preorder(node["right"]))
return r
def get_inorder(node):
if node == None:
return []
r = []
r.extend(get_inorder(node["left"]))
r.append(str(node["data"]))
r.extend(get_inorder(node["right"]))
return r
def print_tree(root):
print(" " + " ".join(get_inorder(root)))
print(" " + " ".join(get_preorder(root)))
def main():
n_line = int(input())
input_list = [input().split()[1] for i in range(n_line - 1)]
root = {"left":None, "right": None, "data":int(input_list[0])}
for s in input_list[1:]:
node = {"left":None, "right": None, "data":int(s)}
insert(root, node)
print_tree(root)
if __name__ == "__main__":
main() | Traceback (most recent call last):
File "/tmp/tmp1yi0o256/tmp3e_r3d2q.py", line 55, in <module>
main()
File "/tmp/tmp1yi0o256/tmp3e_r3d2q.py", line 43, in main
n_line = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s005104551 | p02283 | u112247126 | 1487673571 | Python | Python3 | py | Runtime Error | 0 | 0 | 1381 | import sys
class Node():
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def prewalk(self):
nodeList = [self.key]
if self.left:
nodeList += self.left.prewalk()
if self.right:
nodeList += self.right.prewalk()
return nodeList
def inwalk(self):
nodeList = []
if self.left:
nodeList += self.left.inwalk()
nodeList += [self.key]
if self.right:
nodeList += self.right.inwalk()
return nodeList
def print(self):
print('', ' '.join(map(str, self.root.inwalk())))
print('', ' '.join(map(str, self.root.prewalk())))
class Tree():
def __init__(self):
self.root = None
def insert(self, key):
Nz = Node(key)
Ny = None #???????£?
Nx = self.root
while Nx:
Ny = Nx
if Nz.key < Ny.key:
Nx = Nx.left
else:
Nx = Nx.right
Nz.parent = Ny
if Ny == None:
self.root = Nz
elif Nz.key < Ny.key:
Ny.left = Nz
else:
Ny.right = Nz
tree = Tree()
n = sys.stdin.readline()
for line in sys.stdin:
if line[0] == 'i':
tree.insert(int(line.split()[1]))
else:
tree.print() | ||
s573461463 | p02283 | u462831976 | 1489795829 | Python | Python3 | py | Runtime Error | 0 | 0 | 4760 | # -*- coding: utf-8 -*-
import random
class Tree:
def __init__(self):
self.root = None
def __str__(self):
if self.root == None:
return None
else:
return "TODO"
def print_inorder(self):
self.__inorder(self.root)
def __inorder(self, node):
"""
:param node: Node
:return:
"""
if node is None:
return
else:
self.__inorder(node.left)
print(node.key, end=' ')
self.__inorder(node.right)
def print_preorder(self):
self.__preorder(self.root)
def __preorder(self, node):
"""
:param node: Node
:return:
"""
if node is None:
return
else:
print(node.key, end=' ')
self.__preorder(node.left)
self.__preorder(node.right)
def insert(self, node):
"""
:param node: Node
:return:
"""
if self.root is None:
self.root = node
else:
x = self.root
parent_candidate = x
while x is not None:
parent_candidate = x
if x.key > node.key:
x = x.left
else:
x = x.right
# child to parent link
x = node
x.parent = parent_candidate
# parent to child link
if x.key < x.parent.key:
x.parent.left = x
else:
x.parent.right = x
def find(self, value):
"""
:param value:
:rtype: Node
:return:
"""
x = self.root
while x is not None and x.key != value:
if x.key > value:
x = x.left
else:
x = x.right
return x
def delete(self, value):
found_node = self.find(value)
if found_node is None:
print("value is nothing")
else:
# has no child
if found_node.is_leaf():
# delete link from parent
print(found_node.parent.left.key)
print(found_node.key)
if found_node.parent.left.key == found_node.key:
found_node.parent.left = None
else:
found_node.parent.right = None
else:
# has one child
if found_node.has_one_child():
one_child = found_node.get_one_child()
# change link to parent
one_child.parent = found_node.parent
# chagne link from parent
if found_node.parent.left == found_node:
found_node.parent.left = one_child
else:
found_node.parent.right = one_child
# has two child
else:
next_section_point = found_node.get_next_section_point()
# ?¬???????????????????????????????????????????????¬?????????????????????? p217
# ????????????
key = next_section_point.key
self.delete(next_section_point.key)
found_node.key = key
class Node:
def __init__(self, key):
self.parent = None # type: Node
self.left = None # type: Node
self.right = None # type: Node
self.key = key # type: int
def has_one_child(self):
if self.left is None and self.right is not None:
return True
elif self.left is not None and self.right is None:
return True
else:
return False
def get_one_child(self):
if not self.has_one_child():
return None
else:
if self.left is not None:
return self.left
else:
return self.right
def get_next_section_point(self):
"""?¬??????????????????????"""
# ????????????????????´???
if self.right is not None:
return self.right.get_minimum()
# ???????????????????????´???????¬???????????????´?????????
else:
# ?
return self.parent
def is_leaf(self):
if self.left is None and self.right is None:
return True
else:
return False
def get_minimum(self):
if self.left is None:
return self
else:
return self.left.get_minimum()
n = int(input())
for _ in range(n):
s = input()
value = int(s.split(" "))
tree.insert(value)
tree.print_preorder()
print('')
tree.print_inorder() | Traceback (most recent call last):
File "/tmp/tmpyc05t5of/tmp_9e2z6pe.py", line 174, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s168537355 | p02283 | u462831976 | 1489804226 | Python | Python3 | py | Runtime Error | 40 | 11672 | 5113 | # -*- coding: utf-8 -*-
import random
import sys
import os
class Tree:
def __init__(self):
self.root = None
def __str__(self):
if self.root == None:
return None
else:
return "TODO"
def print_inorder(self):
self.inorder_list = []
self.__inorder(self.root)
return self.inorder_list
def __inorder(self, node):
"""
:param node: Node
:return:
"""
if node is None:
return
else:
self.__inorder(node.left)
self.inorder_list.append(node.key)
self.__inorder(node.right)
def print_preorder(self):
self.preorder_list = []
self.__preorder(self.root)
return self.preorder_list
def __preorder(self, node):
"""
:param node: Node
:return:
"""
if node is None:
return
else:
self.preorder_list.append(node.key)
self.__preorder(node.left)
self.__preorder(node.right)
def insert(self, node):
"""
:param node: Node
:return:
"""
if self.root is None:
self.root = node
else:
x = self.root
parent_candidate = x
while x is not None:
parent_candidate = x
if x.key > node.key:
x = x.left
else:
x = x.right
# child to parent link
x = node
x.parent = parent_candidate
# parent to child link
if x.key < x.parent.key:
x.parent.left = x
else:
x.parent.right = x
def find(self, value):
"""
:param value:
:rtype: Node
:return:
"""
x = self.root
while x is not None and x.key != value:
if x.key > value:
x = x.left
else:
x = x.right
return x
def delete(self, value):
found_node = self.find(value)
if found_node is None:
print("value is nothing")
else:
# has no child
if found_node.is_leaf():
# delete link from parent
print(found_node.parent.left.key)
print(found_node.key)
if found_node.parent.left.key == found_node.key:
found_node.parent.left = None
else:
found_node.parent.right = None
else:
# has one child
if found_node.has_one_child():
one_child = found_node.get_one_child()
# change link to parent
one_child.parent = found_node.parent
# chagne link from parent
if found_node.parent.left == found_node:
found_node.parent.left = one_child
else:
found_node.parent.right = one_child
# has two child
else:
next_section_point = found_node.get_next_section_point()
# ?¬???????????????????????????????????????????????¬?????????????????????? p217
# ????????????
key = next_section_point.key
self.delete(next_section_point.key)
found_node.key = key
class Node:
def __init__(self, key):
self.parent = None # type: Node
self.left = None # type: Node
self.right = None # type: Node
self.key = key # type: int
def has_one_child(self):
if self.left is None and self.right is not None:
return True
elif self.left is not None and self.right is None:
return True
else:
return False
def get_one_child(self):
if not self.has_one_child():
return None
else:
if self.left is not None:
return self.left
else:
return self.right
def get_next_section_point(self):
"""?¬??????????????????????"""
# ????????????????????´???
if self.right is not None:
return self.right.get_minimum()
# ???????????????????????´???????¬???????????????´?????????
else:
# ?
return self.parent
def is_leaf(self):
if self.left is None and self.right is None:
return True
else:
return False
def get_minimum(self):
if self.left is None:
return self
else:
return self.left.get_minimum()
tree = Tree()
s = input()
n = int(s)
for _ in range(n-1):
s = input()
value = int(s.split(" ")[-1])
node = Node(value)
tree.insert(node)
in_list = tree.print_inorder()
in_list = map(str, in_list)
print(' ' + ' '.join(in_list))
pre_list = tree.print_preorder()
pre_list = map(str, pre_list)
print(' ' + ' '.join(pre_list)) | Traceback (most recent call last):
File "/tmp/tmp55u1lsru/tmparselldq.py", line 181, in <module>
s = input()
^^^^^^^
EOFError: EOF when reading a line
| |
s870356863 | p02283 | u426534722 | 1491180791 | Python | Python3 | py | Runtime Error | 30 | 7740 | 800 | class Node():
key = 0
l = None
r = None
def __init__(self, key):
self.key = key
T = [] * int(5e6)
def insert(z):
if z == 0: return
y = None
x = 0
while x is not None:
y = x
x = (T[x].l if T[z].key < T[x].key else T[x].r)
if T[z].key < T[y].key: T[y].l = z
else: T[y].r = z
def inorder(x):
if x == None: return;
inorder(T[x].l);
print("", T[x].key, end="")
inorder(T[x].r);
def preorder(x):
if x == None: return;
print("", T[x].key, end="")
preorder(T[x].l);
preorder(T[x].r);
n = int(input())
for i in range(n):
s = input()
if s == "print":
inorder(0)
print()
preorder(0)
print()
else:
x = int(s.split()[1])
T.append(Node(x))
insert(i) | Traceback (most recent call last):
File "/tmp/tmp8jogxhx5/tmp5hcq_19_.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s416566935 | p02283 | u603049633 | 1496322087 | Python | Python3 | py | Runtime Error | 0 | 0 | 1160 | # Binary Search Tree1
class BinaryTree():
def __init__(self):
self.key = None
self.parent = None
self.left = None
self.right = None
def insert(z):
global root
y = None
x = root
while(x != None):
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def inoder(x):
if x == No???e: return
else:
node = x
inoder(node.left)
ino.append(str(node.key))
inoder(node.right)
def preoder(x):
if x == None: return
else:
node = x
pre.append(str(node.key))
preoder(node.left)
preoder(node.right)
def show(x):
preoder(x)
inoder(x)
print(" ".join(ino))
print(" ".join(pre))
root = None
n = int(input())
T = []
cnt = 0
for i in range(n):
L = input().split()
if L[0] == "insert":
T.append(BinaryTree())
T[cnt].key = int(L[1])
insert(T[cnt])
cnt += 1
else:
pre = []
ino = []
show(root) | File "/tmp/tmp7594i093/tmpdpbv464f.py", line 28
if x == No???e: return
^
SyntaxError: invalid syntax
| |
s336896183 | p02283 | u603049633 | 1496322126 | Python | Python3 | py | Runtime Error | 0 | 0 | 1160 | # Binary Search Tree1
class BinaryTree():
def __init__(self):
self.key = None
self.parent = None
self.left = None
self.right = None
def insert(z):
global root
y = None
x = root
while(x != None):
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def inoder(x):
if x == No???e: return
else:
node = x
inoder(node.left)
ino.append(str(node.key))
inoder(node.right)
def preoder(x):
if x == None: return
else:
node = x
pre.append(str(node.key))
preoder(node.left)
preoder(node.right)
def show(x):
preoder(x)
inoder(x)
print(" ".join(ino))
print(" ".join(pre))
root = None
n = int(input())
T = []
cnt = 0
for i in range(n):
L = input().split()
if L[0] == "insert":
T.append(BinaryTree())
T[cnt].key = int(L[1])
insert(T[cnt])
cnt += 1
else:
pre = []
ino = []
show(root) | File "/tmp/tmpthkofhxw/tmpd64wm0a6.py", line 28
if x == No???e: return
^
SyntaxError: invalid syntax
| |
s642485871 | p02283 | u603049633 | 1496323089 | Python | Python3 | py | Runtime Error | 0 | 0 | 1086 | class BinaryTree():
def __init__(self):
self.key = None
self.parent = None
self.left = None
self.right = None
def insert(z):
global root
y = None
x = root
while(x != None):
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def inoder(x):
if x == No???e: return []
else:
r = []
r.extend(inoder(x.left))
r.append(str(x.key))
r.extend(inoder(x.right))
return r
def preoder(x):
if x == None: return []
else:
r = []
r.append(str(x.key))
r.extend(preoder(x.left))
r.extend(preoder(x.right))
return r
def show(x):
print(" ".join(inoder(x)))
print(" ".join(preoder(x)))
root = None
n = int(input())
for i in range(n):
L = input().split()
if L[0] == "insert":
T = BinaryTree()
T.key = int(L[1])
insert(T)
else:
show(root) | File "/tmp/tmpeq89xpbv/tmp7e8x4kbn.py", line 27
if x == No???e: return []
^
SyntaxError: invalid syntax
| |
s653538229 | p02283 | u603049633 | 1496323202 | Python | Python3 | py | Runtime Error | 0 | 0 | 1085 | class BinaryTree():
def __init__(self):
self.key = None
self.parent = None
self.left = None
self.right = None
def insert(z):
global root
y = None
x = root
while x != None:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def inoder(x):
if x == No???e: return []
else:
r = []
r.extend(inoder(x.left))
r.append(str(x.key))
r.extend(inoder(x.right))
return r
def preoder(x):
if x == None: return []
else:
r = []
r.append(str(x.key))
r.extend(preoder(x.left))
r.extend(preoder(x.right))
return r
def show(x):
print(" ".join(inoder(x)))
print(" ".join(preoder(x)))
root = None
n = int(input())
for i in range(n):
L = input().split()
if L[0] == "insert":
T = BinaryTree()
T.key = int(L[1])
insert(T)
else:
show(root) | File "/tmp/tmpl2xlxsol/tmpfk0_ibvz.py", line 27
if x == No???e: return []
^
SyntaxError: invalid syntax
| |
s088783784 | p02283 | u491916705 | 1502512102 | Python | Python | py | Runtime Error | 0 | 0 | 2157 | class Node():
def __init__(self, id, left=-1, right=-1, parent=-1):
self.id = id
self.left = left
self.right = right
self.parent = parent
def show(self):
print 'node %d: parent = %d, left = %d, right = %d' % (self.id, self.parent, self.left, self.right)
class Stack():
def __init__(self):
self.el = []
def add(self, el):
self.el.append(el)
def pop(self):
return self.el.pop()
def insert(T, z):
global rootId
y = None
if rootId:
x = T[rootId]
while x != None:
y = x
if z.id < x.id:
if x.left == -1:
break
x = T[x.left]
else:
if x.right == -1:
break
x = T[x.right]
z.parent = x.id
if y == None:
rootId = z.id
elif z.id < y.id:
y.left = z.id
else:
y.right = z.id
T[z.id] = z
return T
### input ###
T = {}
a = []
n = int(raw_input())
rootId = None
for i in range(n):
tmp = raw_input().split()
if tmp[0] == 'insert':
T[int(tmp[1])] = Node(int(tmp[1]))
T = insert(T, Node(int(tmp[1])))
elif tmp[0] == 'print':
break
### inorder ###
pos = rootId
st = Stack()
ans = []
while True:
if T[pos].left != -1 and T[pos].left not in ans:
if T[pos].right != -1:
st.add(T[pos].right)
st.add(pos)
pos = T[pos].left
elif T[pos].left == -1 and T[pos].right != -1 and T[pos].right not in ans:
ans.append(pos)
pos = T[pos].right
else:
ans.append(pos)
if len(ans) == len(T):
break
pos = st.pop()
print '', ' '.join(map(str, ans))
### preorder ###
pos = rootId
st = Stack()
ans = []
while True:
ans.append(pos)
if len(ans) == len(T):
break
if T[pos].left != -1 and T[pos].right != -1:
st.add(T[pos].right)
if T[pos].left != -1:
pos = T[pos].left
elif T[pos].left == -1 and T[pos].right != -1:
pos = T[pos].rights
else:
pos = st.pop()
print '', ' '.join(map(str, ans)) | File "/tmp/tmpg02lozbx/tmp0b3mznv8.py", line 8
print 'node %d: parent = %d, left = %d, right = %d' % (self.id, self.parent, self.left, self.right)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s305386069 | p02283 | u939814144 | 1503158543 | Python | Python3 | py | Runtime Error | 0 | 0 | 1833 | class Node():
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
class BinarySearchTree():
def __init__(self):
self.root = None
def insert(self, key):
root_node = self.root
insert_node = Node(key)
parent_node = None
while root_node:
parent_node = root_node
if insert_node.key < root_node.key:
root_node = root_node.left
else:
root_node = root_node.right
insert_node.parent = parent_node
if parent_node is None:
self.root = insert_node
elif insert_node.key < parent_node.key:
parent_node.left = insert_node
else:
parent_node.right = insert_node
def show_preorder(self, node):
node_list = []
node_list.append(node.key)
if node.left is not None:
node_list.extend(self.show_preorder(node.left))
if node.right is not None:
node_list.extend(self.show_preorder(node.right))
return node_list
def show_inorder(self, node):
node_list = []
if node.left is not None:
node_list.extend(self.show_inorder(node.left))
node_list.append(node.key)
if node.right is not None:
node_list.extend(self.show_inorder(node.right))
return node_list
def print(self):
print(' ' + *self.show_inorder(self.root))
print(' ' + *self.show_preorder(self.root))
if __name__ == '__main__':
tree = BinarySearchTree()
n = int(input())
for i in range(n):
command = input().split()
if command[0] == 'insert':
tree.insert(int(command[1]))
elif command[0] == 'print':
tree.print() | File "/tmp/tmpl93ohyde/tmpft5nsp_l.py", line 57
print(' ' + *self.show_inorder(self.root))
^
SyntaxError: invalid syntax
| |
s443580935 | p02283 | u798803522 | 1512402695 | Python | Python3 | py | Runtime Error | 0 | 0 | 1855 | with open("test.txt", "r") as f:
class BinarySearchTree:
def __init__(self):
self.root = None
def insert(self, x):
node = self.Node(x)
if self.root is None:
self.root = node
else:
here = self.root
#
temp = None
while here is not None:
temp = here
if x < here.node:
here = here.left
elif x > here.node:
here = here.right
if x < temp.node:
temp.left = node
elif x > temp.node:
temp.right = node
def inorder(self, answer, address = "root"):
if address is "root":
address = self.root
elif address is None:
return
self.inorder(answer, address.left)
answer.append(address.node)
self.inorder(answer, address.right)
def preorder(self, answer, address = "root"):
if address is "root":
address = self.root
elif address is None:
return
answer.append(address.node)
self.preorder(answer, address.left)
self.preorder(answer, address.right)
class Node:
def __init__(self, x):
self.node = x
self.left = None
self.right = None
query = int(f.readline())
bt = BinarySearchTree()
for _ in range(query):
command = f.readline()
if command[0] == "i":
bt.insert(int(command.split(" ")[1]))
else:
a = []
bt.inorder(a)
print(*a)
a = []
bt.preorder(a)
print(*a) | /tmp/tmph0d6907q/tmppqndgukp.py:26: SyntaxWarning: "is" with a literal. Did you mean "=="?
if address is "root":
/tmp/tmph0d6907q/tmppqndgukp.py:35: SyntaxWarning: "is" with a literal. Did you mean "=="?
if address is "root":
Traceback (most recent call last):
File "/tmp/tmph0d6907q/tmppqndgukp.py", line 1, in <module>
with open("test.txt", "r") as f:
^^^^^^^^^^^^^^^^^^^^^
FileNotFoundError: [Errno 2] No such file or directory: 'test.txt'
| |
s502099647 | p02283 | u798803522 | 1512402722 | Python | Python3 | py | Runtime Error | 0 | 0 | 1602 | class BinarySearchTree:
def __init__(self):
self.root = None
def insert(self, x):
node = self.Node(x)
if self.root is None:
self.root = node
else:
here = self.root
#
temp = None
while here is not None:
temp = here
if x < here.node:
here = here.left
elif x > here.node:
here = here.right
if x < temp.node:
temp.left = node
elif x > temp.node:
temp.right = node
def inorder(self, answer, address = "root"):
if address is "root":
address = self.root
elif address is None:
return
self.inorder(answer, address.left)
answer.append(address.node)
self.inorder(answer, address.right)
def preorder(self, answer, address = "root"):
if address is "root":
address = self.root
elif address is None:
return
answer.append(address.node)
self.preorder(answer, address.left)
self.preorder(answer, address.right)
class Node:
def __init__(self, x):
self.node = x
self.left = None
self.right = None
query = int(f.readline())
bt = BinarySearchTree()
for _ in range(query):
command = f.readline()
if command[0] == "i":
bt.insert(int(command.split(" ")[1]))
else:
a = []
bt.inorder(a)
print(*a)
a = []
bt.preorder(a)
print(*a) | /tmp/tmprgmbtva2/tmp30r75xg7.py:25: SyntaxWarning: "is" with a literal. Did you mean "=="?
if address is "root":
/tmp/tmprgmbtva2/tmp30r75xg7.py:34: SyntaxWarning: "is" with a literal. Did you mean "=="?
if address is "root":
Traceback (most recent call last):
File "/tmp/tmprgmbtva2/tmp30r75xg7.py", line 48, in <module>
query = int(f.readline())
^
NameError: name 'f' is not defined
| |
s911339157 | p02283 | u150984829 | 1519492343 | Python | Python3 | py | Runtime Error | 0 | 0 | 1124 | import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)
while x != None:
y = x
x = x.left if z.key < x.key else x.right
if y == None: self.root = z
else:
if z.key < y.key: y.left = z
else: y.right = z
def print_tree(self):
def inorder(node):
if node:
inorder(node.left)
temp += f' {node.key}'
inorder(node.right)
def preorder(node):
if node:
temp += f' {node.key}'
preorder(node.left)
preorder(node.right)
temp = ''
inorder(self.root)
print(temp)
temp = ''
preorder(self.root)
print(temp)
tree = BST()
input()
for e in sys.stdin:
if e[0] == 'i': tree.insert(int(e[7:]))
else: tree.print_tree()
| Traceback (most recent call last):
File "/tmp/tmpjm3fthq9/tmpy5mkrgqs.py", line 43, in <module>
input()
EOFError: EOF when reading a line
| |
s532432716 | p02283 | u150984829 | 1519493578 | Python | Python3 | py | Runtime Error | 0 | 0 | 911 | import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y = self.root, None
while x != None: x, y = x.left if key < x.key else x.right, x
if y == None: self.root = Node(key)
elif key < y.key: y.left = Node(key)
else: y.right = z
def print_tree(self):
def inorder(node):
return inorder(node.left) + f' {node.key}' + inorder(node.right) if node else ''
def preorder(node):
return f' {node.key}' + preorder(node.left) + preorder(node.right) if node else ''
print(inorder(self.root))
print(preorder(self.root))
tree = BST()
input()
for e in sys.stdin:
if e[0] == 'i': tree.insert(int(e[7:]))
else: tree.print_tree()
| Traceback (most recent call last):
File "/tmp/tmp2o5zzp84/tmp9doyl1ly.py", line 27, in <module>
input()
EOFError: EOF when reading a line
| |
s208113231 | p02283 | u150984829 | 1519493621 | Python | Python3 | py | Runtime Error | 0 | 0 | 911 | import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y = self.root, None
while x != None: x, y = x.left if key < x.key else x.right, x
if y == None: self.root = Node(key)
elif key < y.key: y.left = Node(key)
else: y.right = z
def print_tree(self):
def inorder(node):
return inorder(node.left) + f' {node.key}' + inorder(node.right) if node else ''
def preorder(node):
return f' {node.key}' + preorder(node.left) + preorder(node.right) if node else ''
print(inorder(self.root))
print(preorder(self.root))
tree = BST()
input()
for e in sys.stdin:
if e[0] == 'i': tree.insert(int(e[7:]))
else: tree.print_tree()
| Traceback (most recent call last):
File "/tmp/tmp52vz2c54/tmpcngf7rgx.py", line 27, in <module>
input()
EOFError: EOF when reading a line
| |
s967276402 | p02283 | u724548524 | 1525403009 | Python | Python3 | py | Runtime Error | 0 | 0 | 828 | import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None
root = None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == -1:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
input()
node = {}
root = -1
for s in sys.stdin:
if s[0] == "p":
print(inorder(root))
print(preorder(root))
else:
insert(node, int(s[7:]))
| Traceback (most recent call last):
File "/tmp/tmplugwf5np/tmp03pfw8r7.py", line 33, in <module>
input()
EOFError: EOF when reading a line
| |
s205629382 | p02283 | u724548524 | 1525403028 | Python | Python3 | py | Runtime Error | 0 | 0 | 822 | import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None
root = None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == -1:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
input()
node = {}
root = -1
for s in sys.stdin:
if s[0] == "p":
print(inorder(root))
print(preorder(root))
else:
insert(int(s[7:]))
| Traceback (most recent call last):
File "/tmp/tmpuk3i5lwn/tmpy03izcx1.py", line 33, in <module>
input()
EOFError: EOF when reading a line
| |
s695690316 | p02283 | u724548524 | 1525403037 | Python | Python3 | py | Runtime Error | 0 | 0 | 821 | import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None
root = None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == -1:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
input()
node = {}
root = -1
for s in sys.stdin:
if s[0] == "p":
print(inorder(root))
print(preorder(root))
else:
insert(int(s[7:])
| File "/tmp/tmpkq0o5lva/tmp0yavqp0v.py", line 41
insert(int(s[7:])
^
SyntaxError: '(' was never closed
| |
s704164289 | p02283 | u724548524 | 1525403067 | Python | Python3 | py | Runtime Error | 0 | 0 | 822 | import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None
root = None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == -1:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
input()
node = {}
root = -1
for s in sys.stdin:
if s[0] == "p":
print(inorder(root))
print(preorder(root))
else:
insert(int(s[7:]))
| Traceback (most recent call last):
File "/tmp/tmpk53j525n/tmp04dbw3i_.py", line 33, in <module>
input()
EOFError: EOF when reading a line
| |
s344393163 | p02283 | u126478680 | 1526904012 | Python | Python3 | py | Runtime Error | 0 | 0 | 2268 | from collections import deque
from enum import Enum, auto
class BinaryTreeNode():
__slots__ = ['left', 'right', 'val']
def __init__(self, left=None, right=None, val=None):
self.left = left
self.right = right
self.val = val
class BinarySearchTree():
def __init__(self):
self.root = None
self.nodes = deque([])
self.num_nodes = 0
self.inorder = ''
self.preorder = ''
def insert(self, val):
y = None
x = self.root
while x != None:
y = x
if val < self.nodes[x].val:
x = self.nodes[x].left
else:
x = self.nodes[x].right
node = BinaryTreeNode(val=val)
if y == None:
self.root = 0
elif node.val < self.nodes[y].val:
self.nodes[y].left = self.num_nodes
else:
self.nodes[y].right = self.num_nodes
self.nodes.append(node)
self.num_nodes += 1
def preorder(self):
self.preorder = ''
def preorder_bfs(s):
self.preorder += ' ' + str(self.nodes[s].val)
if self.nodes[s].left != None:
preorder_bfs(self.nodes[s].left)
if self.nodes[s].right != None:
preorder_bfs(self.nodes[s].right)
preorder_bfs(self.root)
return self.preorder
def inorder(self):
self.inorder = ''
inorder_stack = deque([])
def inorder_dfs_init(s):
inorder_stack.append(s)
inorder_dfs()
def inorder_dfs():
u = inorder_stack.pop()
if self.nodes[u].left != None:
inorder_stack.append(u)
inorder_stack.append(self.nodes[u].left)
inorder_dfs()
self.inorder += ' ' + str(self.nodes[u].val)
if self.nodes[u].right != None:
inorder_stack.append(self.nodes[u].right)
inorder_dfs()
inorder_dfs_init(self.root)
return self.inorder
m = int(input())
bst = BinarySearchTree()
for i in range(m):
op = input()
if op == 'print':
print(bst.inorder())
print(bst.preorder())
else:
num = int(op[7:])
bst.insert(num)
| Traceback (most recent call last):
File "/tmp/tmpswu_scsn/tmp5kazi23y.py", line 71, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s561799819 | p02283 | u126478680 | 1526904508 | Python | Python3 | py | Runtime Error | 30 | 6344 | 2292 | from collections import deque
from enum import Enum, auto
class BinaryTreeNode():
__slots__ = ['left', 'right', 'val']
def __init__(self, left=None, right=None, val=None):
self.left = left
self.right = right
self.val = val
class BinarySearchTree():
def __init__(self):
self.root = None
self.nodes = deque([])
self.num_nodes = 0
self.inorder_str = ''
self.preorder_str = ''
def insert(self, val):
y = None
x = self.root
while x != None:
y = x
if val < self.nodes[x].val:
x = self.nodes[x].left
else:
x = self.nodes[x].right
node = BinaryTreeNode(val=val)
if y == None:
self.root = 0
elif node.val < self.nodes[y].val:
self.nodes[y].left = self.num_nodes
else:
self.nodes[y].right = self.num_nodes
self.nodes.append(node)
self.num_nodes += 1
def preorder(self):
self.preorder = ''
def preorder_bfs(s):
self.preorder_str += ' ' + str(self.nodes[s].val)
if self.nodes[s].left != None:
preorder_bfs(self.nodes[s].left)
if self.nodes[s].right != None:
preorder_bfs(self.nodes[s].right)
preorder_bfs(self.root)
return self.preorder_str
def inorder(self):
self.inorder = ''
inorder_stack = deque([])
def inorder_dfs_init(s):
inorder_stack.append(s)
inorder_dfs()
def inorder_dfs():
u = inorder_stack.pop()
if self.nodes[u].left != None:
inorder_stack.append(u)
inorder_stack.append(self.nodes[u].left)
inorder_dfs()
self.inorder_str += ' ' + str(self.nodes[u].val)
if self.nodes[u].right != None:
inorder_stack.append(self.nodes[u].right)
inorder_dfs()
inorder_dfs_init(self.root)
return self.inorder_str
m = int(input())
bst = BinarySearchTree()
for i in range(m):
op = input()
if op == 'print':
print(bst.inorder())
print(bst.preorder())
else:
num = int(op[7:])
bst.insert(num)
| Traceback (most recent call last):
File "/tmp/tmpjfunivg0/tmpb0edhmi8.py", line 71, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s261151222 | p02283 | u404682284 | 1528281866 | Python | Python3 | py | Runtime Error | 0 | 0 | 2824 | class NullNode():
def __init__(self):
self.id = None
class Node():
def __init__(self, id):
self.id = id
self.parent = NullNode()
self.left = NullNode()
self.right = NullNode()
def preorder(node, out_list=[]):
if node.id is not None:
out_list.append(str(node.id))
out_list = preorder(node.left, out_list)
out_list = preorder(node.right, out_list)
return out_list
def inorder(node, out_list=[]):
if node.id is not None:
out_list = inorder(node.left, out_list)
out_list.append(str(node.id))
out_list = inorder(node.right, out_list)
return out_list
def insert(node, root_node):
temp_node_parent = root_node.parent
temp_node = root_node
while temp_node.id is not None:
temp_node_parent = temp_node
if node.id < temp_node.id:
temp_node = temp_node.left
else:
temp_node = temp_node.right
node.parent = temp_node_parent
if node.id < temp_node_parent.id:
temp_node_parent.left = node
else:
temp_node_parent.right = node
# def find(id,root_node):
# node = root_node
# while node.id is not None:
# if id < node.id:
# node = node.left
# elif id > node.id:
# node = node.right
# else:
# print('yes')
# break
# else:
# print('no')
#
# def delete(id, root_node):
# # 作成中
# type = ''
# node = root_node
# node_parent = NullNode()
# while node.id != id:
# node_parent = node
# if id < node.id:
# node = node.left
# type = 'L'
# else:
# node = node.right
# type = 'R'
# if node.right is not None:
# node.right.parent = node_parent
# elif node.left is not None:
# node.left.parent = node_parent
# else:
# node.parent = NullNode()
#
# if type == 'L':
# node_parent.left = NullNode()
# else:
# node_parent.right = NullNode()
n = int(input())
input_lines = sys.stdin.readlines()
root_node = NullNode()
for i in range(n):
input_line = input_lines[i].split()
command = input_line[0]
if command == 'insert':
id = int(input_line[1])
id_node = Node(id)
if root_node.id is None:
root_node = id_node
else:
insert(id_node, root_node)
# elif command == 'find':
# id = int(input_line[1])
# find(id, root_node)
#
# elif command == 'delete':
# id = int(input_line[1])
# delete(id, root_node)
else:
inorder_list = inorder(root_node, [])
preorder_list = preorder(root_node, [])
print(' ' + ' '.join(inorder_list))
print(' ' + ' '.join(preorder_list))
| Traceback (most recent call last):
File "/tmp/tmp5c_3wj15/tmphzyrhfxx.py", line 81, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s233038328 | p02283 | u318430977 | 1528995477 | Python | Python3 | py | Runtime Error | 0 | 0 | 687 | def reconstruct(pre_list, in_list):
if len(pre_list) <= 1:
return pre_list
now = pre_list[0]
split_place = in_list.index(now)
pre_left = pre_list[1:split_place + 1]
in_left = in_list[0:split_place]
pre_right = pre_list[split_place + 1:]
in_right = in_list[split_place + 1:]
return reconstruct(pre_left, in_left) + reconstruct(pre_right, in_right) + [now]
def print_list_split_whitespace(a):
for x in a[:-1]:
print(x, end=" ")
print(a[-1])
n = int(input())
pre_list = [int(x) for x in input().split()]
in_list = [int(x) for x in input().split()]
post_list = reconstruct(pre_list, in_list)
print_list_split_whitespace(post_list)
| Traceback (most recent call last):
File "/tmp/tmp87dqqkok/tmpvbspg73i.py", line 18, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s229440462 | p02284 | u798803522 | 1540187834 | Python | Python3 | py | Runtime Error | 0 | 0 | 2430 | from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringIO()
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
root = self.root
temp = None
while True:
temp = root
if key > root.key:
root = root.right
if root is None:
temp.right = self.Node(key)
break
else:
root = root.left
if root is None:
temp.left = self.Node(key)
break
def ini_print_inorder(self):
self.output = StringIO()
self.print_inorder(self.root)
return self.output.getvalue()
def ini_print_preorder(self):
self.output = StringIO()
self.print_preorder(self.root)
return self.output.getvalue()
def print_inorder(self, node):
if node is not None:
self.print_inorder(node.left)
print(node.key, end = " ", file = self.output)
self.print_inorder(node.right)
def print_preorder(self, node):
if node is not None:
print(node.key, end = " ", file = self.output)
self.print_preorder(node.left)
self.print_preorder(node.right)
def test_insert(self, keys):
for k in keys:
self.insert(k)
def ini_find(self, key):
print(self.find(key))
def find(self, key):
root = self.root
while root is not None:
if key == root.key:
return "no"
elif key < root.key:
root = root.left
else:
root = root.right
return "yes"
length = int(input())
b = BinaryTree()
for _ in range(length):
comm = input()
if comm[0] == "i":
com, num = comm.split(" ")
b.insert(int(num))
elif comm[0] == "f":
print(" ", end = "")
print((b.ini_print_inorder())[:-1])
print(" ", end = "")
print(b.ini_print_preorder()[:-1])
else:
com, num = comm.split(" ")
b.ini_find(num)
| Traceback (most recent call last):
File "/tmp/tmptrouagz1/tmp38361mgb.py", line 77, in <module>
length = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s203806655 | p02284 | u798803522 | 1540187915 | Python | Python3 | py | Runtime Error | 0 | 0 | 2423 | from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringIO()
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
root = self.root
temp = None
while True:
temp = root
if key > root.key:
root = root.right
if root is None:
temp.right = self.Node(key)
break
else:
root = root.left
if root is None:
temp.left = self.Node(key)
break
def ini_print_inorder(self):
self.output = StringIO()
self.print_inorder(self.root)
return self.output.getvalue()
def ini_print_preorder(self):
self.output = StringIO()
self.print_preorder(self.root)
return self.output.getvalue()
def print_inorder(self, node):
if node is not None:
self.print_inorder(node.left)
print(node.key, end = " ", file = self.output)
self.print_inorder(node.right)
def print_preorder(self, node):
if node is not None:
print(node.key, end = " ", file = self.output)
self.print_preorder(node.left)
self.print_preorder(node.right)
def test_insert(self, keys):
for k in keys:
self.insert(k)
def ini_find(self, key):
print(self.find(key))
def find(self, key):
root = self.root
while root is not None:
if key == root.key:
return "yes"
elif key < root.key:
root = root.left
else:
root = root.right
return "no"
length = int(input())
b = BinaryTree()
for _ in range(length):
comm = input()
if comm[0] == "i":
com, num = comm.split(" ")
b.insert(int(num))
elif comm[0] == "f":
print(" ", end = "")
print((b.ini_print_inorder())[:-1])
print(" ", end = "")
print(b.ini_print_preorder()[:-1])
else:
com, num = comm.split(" ")
b.ini_find(num)
| Traceback (most recent call last):
File "/tmp/tmp899n_0_r/tmpjy_j7pod.py", line 77, in <module>
length = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s703531704 | p02284 | u798803522 | 1540188008 | Python | Python3 | py | Runtime Error | 0 | 0 | 2423 | from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringIO()
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
root = self.root
temp = None
while True:
temp = root
if key > root.key:
root = root.right
if root is None:
temp.right = self.Node(key)
break
else:
root = root.left
if root is None:
temp.left = self.Node(key)
break
def ini_print_inorder(self):
self.output = StringIO()
self.print_inorder(self.root)
return self.output.getvalue()
def ini_print_preorder(self):
self.output = StringIO()
self.print_preorder(self.root)
return self.output.getvalue()
def print_inorder(self, node):
if node is not None:
self.print_inorder(node.left)
print(node.key, end = " ", file = self.output)
self.print_inorder(node.right)
def print_preorder(self, node):
if node is not None:
print(node.key, end = " ", file = self.output)
self.print_preorder(node.left)
self.print_preorder(node.right)
def test_insert(self, keys):
for k in keys:
self.insert(k)
def ini_find(self, key):
print(self.find(key))
def find(self, key):
root = self.root
while root is not None:
if key == root.key:
return "yes"
elif key < root.key:
root = root.left
else:
root = root.right
return "no"
length = int(input())
b = BinaryTree()
for _ in range(length):
comm = input()
if comm[0] == "i":
com, num = comm.split(" ")
b.insert(int(num))
elif comm[0] == "p":
print(" ", end = "")
print((b.ini_print_inorder())[:-1])
print(" ", end = "")
print(b.ini_print_preorder()[:-1])
else:
com, num = comm.split(" ")
b.ini_find(num)
| Traceback (most recent call last):
File "/tmp/tmpvkhr1jtv/tmpffeu84e6.py", line 77, in <module>
length = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s215648082 | p02284 | u130979865 | 1460172044 | Python | Python | py | Runtime Error | 0 | 0 | 1361 | # -*- coding: utf-8 -*-
class Node_Class():
def __init__(self, key, parent, left, right):
self.key = key
self.parent = parent
self.left = left
self.right = right
def insert(z):
global root
y = None
x = root
while x != None:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y is None:
root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def find(k):
global root
x = root
while x != None:
if x.key == k:
print "yes"
return
elif k < x.key:
x = x.left
else:
x = x.right
print "no"
def pre_order(node):
if node is not None:
print node.key,
pre_order(node.left)
pre_order(node.right)
def in_order(node):
if node is not None:
in_order(node.left)
print node.key,
in_order(node.right)
m = int(raw_input())
root = None
for i in range(m):
line = map(str, raw_input().split())
if line[0] == "insert":
z = Node_Class(int(line[1]), None, None, None)
insert(z)
elif line[0] == "find":
find(int(line[1]))
else:
print "".
in_order(root)
print
print "",
pre_order(root)
print | File "/tmp/tmpnd9coaa5/tmpepzxacgp.py", line 33
print "yes"
^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s574410279 | p02284 | u684241248 | 1528193020 | Python | Python3 | py | Runtime Error | 0 | 0 | 2004 | class Tree:
def __init__(self, orders):
self.root = None
for order in orders:
if len(order) == 1:
self.inorder_print()
self.preorder_print()
else:
if len(order[0]) == 4:
self.find(int(order[1]))
else:
self.insert(int(order[1]))
def insert(self, key):
z = Node(key)
y = None
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if not y:
self.root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def find(self, key):
self.root.find(key)
def inorder_print(self):
self.root.inorder_print()
print()
def preorder_print(self):
self.root.preorder_print()
print()
class Node:
def __init_(self, key):
self.key = key
self.parent = None
self.left = None
self.right = None
def find(self, key):
k = self.key
if key == k:
print('yes')
elif key < k:
if self.left:
self.left.find(key)
else:
print('no')
else:
if self.right:
self.right.find(key)
else:
print('no')
def inorder_print(self):
if self.left:
self.left.inorder_print()
print(' {}'.format(self.key), end='')
if self.right:
self.right.inorder_print()
def preorder_print(self):
print(' {}'.format(self.key), end='')
if self.left:
self.left.preorder_print()
if self.right:
self.right.preorder_print()
if __name__ == '__main__':
import sys
m = int(input())
orders = [line.strip().split() for line in sys.stdin]
Tree(orders)
| Traceback (most recent call last):
File "/tmp/tmpf_s_z777/tmp9x22j2ck.py", line 84, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s708922663 | p02284 | u912237403 | 1373888572 | Python | Python | py | Runtime Error | 0 | 0 | 1151 | import sys
tree={}
np = -1
home=0
tree[home]=[None, None, None]
def search(p, x):
while p != None:
tmp = tree[p]
if tmp[0] == x: return True
if x < tmp[0]:
p = tmp[1]
else:
p = tmp[2]
return False
def node(x):
global np
np += 1
tree[np] = [x, None, None]
return np
def insert(p, x):
if p == None or np == -1: return node(x)
tmp = tree[p]
if x== tmp[0]: return p
elif x<tmp[0]:
tree[p][1]=insert(tmp[1],x)
else:
tree[p][2]=insert(tmp[2],x)
return p
def preorder(p):
if p == None: return []
p1, p2 = tree[p][1:3]
return [tree[p][0]] + preorder(p1) + preorder(p2)
def inorder(p):
if p == None: return []
p1, p2 = tree[p][1:3]
return inorder(p1) + [tree[p][0]] +inorder(p2)
n = int(input())
i = 0
while i<n:
s = raw_input()
if s[0]=='i':
insert(0,int(s[7:]))
elif s[0]=='f':
if search(0,int(s[5:])): print 'yes'
else print 'no'
elif s[0]=='p':
print ' ' + ' '.join(map(str, inorder(home)))
print ' ' + ' '.join(map(str, preorder(home)))
i += 1 | File "/tmp/tmpa48f9d5i/tmp7nova1dg.py", line 52
if search(0,int(s[5:])): print 'yes'
^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s803992963 | p02285 | u597769560 | 1551539244 | Python | Python3 | py | Runtime Error | 20 | 5648 | 2368 | # -*- coding: utf-8 -*-
"""
Created on Sat Mar 2 17:11:49 2019
@author: Yamazaki Kenichi
"""
m = int(input())
A = [list(input().split()) for i in range(m)]
T = [[-1,-1,-1,-1]]
def insert(T,u,x):
if T[0][3] == -1:
T[0][3] = x
return
if x < T[u][3]:
if T[u][1] == -1:
T[u][1] = len(T)
T.append([u,-1,-1,x])
else:
insert(T,T[u][1],x)
else:
if T[u][2] == -1:
T[u][2] = len(T)
T.append([u,-1,-1,x])
else:
insert(T,T[u][2],x)
def ino(u):
if T[u][1] != -1:
ino(T[u][1])
ino_res.append(str(T[u][3]))
if T[u][2] != -1:
ino(T[u][2])
def pre(u):
pre_res.append(str(T[u][3]))
if T[u][1] != -1:
pre(T[u][1])
if T[u][2] != -1:
pre(T[u][2])
def find(u,x):
if x == T[u][3]:
return True
elif x < T[u][3]:
if T[u][1] == -1:
return False
return find(T[u][1],x)
else:
if T[u][2] == -1:
return False
return find(T[u][2],x)
def dele(u,x):
if T[u][1] == -1 and T[u][2] == -1:
if T[T[u][0]][1] == u:
T[T[u][0]][1] = -1
else:
T[T[u][0]][2] = -1
elif T[u][1] != -1 and T[u][2] != -1:
T[u][3] = T[T[u][0]][3]
if T[T[u][0]][1] == u:
T[T[u][0]][1] = -1
else:
T[T[u][0]][2] = -1
dele(T[u][0])
elif T[u][1] != -1:
if T[T[u][0]][1] == u:
T[T[u][0]][1] = T[u][1]
T[T[u][1]][0] = T[u][0]
else:
T[T[u][0]][2] = T[u][1]
T[T[u][2]][0] = T[u][0]
elif T[u][2] != -1:
if T[T[u][0]][1] == u:
T[T[u][0]][1] = T[u][2]
T[T[u][1]][0] = T[u][0]
else:
T[T[u][0]][2] = T[u][2]
T[T[u][2]][0] = T[u][0]
def delete(u,x):
if x == T[u][3]:
dele(u,x)
elif x < T[u][3]:
delete(T[u][1],x)
else:
delete(T[u][2],x)
for c in A:
if c[0] == 'insert':
insert(T,0,int(c[1]))
elif c[0] == 'find':
print('yes') if find(0,int(c[1])) else print('no')
elif c[0] == 'delete':
delete(0,int(c[1]))
else:
ino_res = []
ino(0)
pre_res = []
pre(0)
print(' '+' '.join(ino_res))
print(' '+' '.join(pre_res))
| Traceback (most recent call last):
File "/tmp/tmpy7zx4l4h/tmp3b0kuxvo.py", line 8, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s830438275 | p02285 | u357267874 | 1556281307 | Python | Python3 | py | Runtime Error | 20 | 5620 | 4456 | class Node:
def __init__(self, key):
self.key = key
self.parent = None
self.left = None
self.right = None
class Tree:
def __init__(self):
self.root = None
self.inorder = []
self.preorder = []
def insert(self, node):
p = None
x = self.root
while x is not None:
p = x
# print(node.key, x.key)
if node.key <= x.key:
x = x.left
else:
x = x.right
# insertするnodeの親を設定
node.parent = p
if p is None:
self.root = node
else:
# insertするnodeを親のleftかrightに設定
if node.key <= p.key:
# print('leftに設定')
p.left = node
else:
# print('rightに設定')
p.right = node
def find(self, key):
# print('find: ', str(key))
node = self.root
while node is not None:
if node.key == key:
return node
elif key <= node.key:
node = node.left
else:
node = node.right
return None
def delete(self, z):
# print("delete =========")
# print(z.key)
p = z.parent
# 1. zが子を持たない場合
if z.left is None and z.right is None:
# print('pattern 1')
if p.left.key == z.key:
p.left = None
else:
p.right = None
# 3. zが子を2つ持つ場合
elif z.left is not None and z.right is not None:
# print('pattern 2')
next_node = tree.get_next_node(z)
z.key = next_node.key
if next_node == next_node.parent.left:
next_node.parent.left = None
else:
next_node.parent.right = None
# 2. zがちょうど1つの子を持つ場合
else:
# print('pattern 3')
# zが左子だった場合
if p.left.key == z.key:
if z.left is not None:
p.left = z.left
z.left.parent = p
else:
p.left = z.right
z.right.parent = p
else:
# zが右子だった場合
if z.left is not None:
p.right = z.left
z.left.parent = p
else:
p.right = z.right
z.right.parent = p
def get_next_node(self, node):
if node.right is not None:
return self.get_minimum(node)
p = x.parent
while p is not None and p != p.parent.left:
p = p.parent
return p.parent
def get_minimum(self, node):
x = node
while x.left is not None:
x = x.left
return x
def print_inorder(self):
self.inorder = []
self.inorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.inorder)))
def print_preorder(self):
self.preorder = []
self.preorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.preorder)))
def inorder_traverse(self, node):
if node is None:
return
self.inorder_traverse(node.left)
self.inorder.append(node.key)
self.inorder_traverse(node.right)
def preorder_traverse(self, node):
if node is None:
return
self.preorder.append(node.key)
self.preorder_traverse(node.left)
self.preorder_traverse(node.right)
tree = Tree()
m = int(input())
for i in range(m):
line = input().split()
if line[0] == 'print':
tree.print_inorder()
tree.print_preorder()
elif line[0] == 'insert':
key = int(line[1])
tree.insert(Node(key))
elif line[0] == 'find':
key = int(line[1])
if tree.find(key):
print('yes')
else:
print('no')
elif line[0] == 'delete':
# print("current tree----")
# print(tree.root.key)
# print(tree.root.left.key)
# print(tree.root.left.right.key)
# print(tree.root.left.right.parent.key)
# print("current tree----")
key = int(line[1])
node = tree.find(key)
# print(node.key)
tree.delete(node)
| Traceback (most recent call last):
File "/tmp/tmp53hgapzn/tmp398ks248.py", line 133, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s224309963 | p02285 | u357267874 | 1556328066 | Python | Python3 | py | Runtime Error | 20 | 5624 | 4409 | class Node:
def __init__(self, key):
self.key = key
self.parent = None
self.left = None
self.right = None
class Tree:
def __init__(self):
self.root = None
self.inorder = []
self.preorder = []
def insert(self, node):
p = None
x = self.root
while x is not None:
p = x
# print(node.key, x.key)
if node.key <= x.key:
x = x.left
else:
x = x.right
# insertするnodeの親を設定
node.parent = p
if p is None:
self.root = node
else:
# insertするnodeを親のleftかrightに設定
if node.key <= p.key:
# print('leftに設定')
p.left = node
else:
# print('rightに設定')
p.right = node
def find(self, key):
# print('find: ', str(key))
node = self.root
while node is not None:
if node.key == key:
return node
elif key <= node.key:
node = node.left
else:
node = node.right
return None
def delete(self, z):
# print("delete =========", z.key)
# print(z.key)
# print(z.parent)
p = z.parent
# 1. zが子を持たない場合
if z.left is None and z.right is None:
# print('pattern 1')
if p.left.key == z.key:
p.left = None
else:
p.right = None
# 3. zが子を2つ持つ場合
elif z.left is not None and z.right is not None:
# print('pattern 2')
next_node = tree.get_next_node(z)
z.key = next_node.key
self.delete(next_node)
# 2. zがちょうど1つの子を持つ場合
else:
# print('pattern 3')
# zが左子だった場合
if p.left.key == z.key:
if z.left is not None:
p.left = z.left
z.left.parent = p
else:
p.left = z.right
z.right.parent = p
else:
# zが右子だった場合
if z.left is not None:
p.right = z.left
z.left.parent = p
else:
p.right = z.right
z.right.parent = p
def get_next_node(self, node):
if node.right is not None:
return self.get_minimum(node)
p = x.parent
while p is not None and p != p.parent.left:
p = p.parent
return p.parent
def get_minimum(self, node):
x = node
while x.left is not None:
x = x.left
return x
def print_inorder(self):
self.inorder = []
self.inorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.inorder)))
def print_preorder(self):
self.preorder = []
self.preorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.preorder)))
def inorder_traverse(self, node):
if node is None:
return
self.inorder_traverse(node.left)
self.inorder.append(node.key)
self.inorder_traverse(node.right)
def preorder_traverse(self, node):
if node is None:
return
self.preorder.append(node.key)
self.preorder_traverse(node.left)
self.preorder_traverse(node.right)
tree = Tree()
m = int(input())
for i in range(m):
line = input().split()
if line[0] == 'print':
tree.print_inorder()
tree.print_preorder()
elif line[0] == 'insert':
key = int(line[1])
tree.insert(Node(key))
elif line[0] == 'find':
key = int(line[1])
if tree.find(key):
print('yes')
else:
print('no')
elif line[0] == 'delete':
# print("current tree----")
# print(tree.root.key)
# print(tree.root.left.key)
# print(tree.root.left.right.key)
# print(tree.root.left.right.parent.key)
# print("current tree----")
key = int(line[1])
# print('delete', str(key))
node = tree.find(key)
# print(node.key)
tree.delete(node)
| Traceback (most recent call last):
File "/tmp/tmpbmf44lx_/tmp3ahggh0k.py", line 131, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s847618281 | p02285 | u357267874 | 1556336570 | Python | Python3 | py | Runtime Error | 30 | 5624 | 5022 | class Node:
def __init__(self, key):
self.key = key
self.parent = None
self.left = None
self.right = None
class Tree:
def __init__(self):
self.root = None
self.inorder = []
self.preorder = []
def insert(self, node):
p = None
x = self.root
while x is not None:
p = x
# print(node.key, x.key)
if node.key <= x.key:
x = x.left
else:
x = x.right
# insertするnodeの親を設定
node.parent = p
if p is None:
self.root = node
else:
# insertするnodeを親のleftかrightに設定
if node.key <= p.key:
# print('leftに設定')
p.left = node
else:
# print('rightに設定')
p.right = node
def find(self, key):
# print('find: ', str(key))
node = self.root
while node is not None:
if node.key == key:
return node
elif key <= node.key:
node = node.left
else:
node = node.right
return None
def delete(self, z):
# print("delete =========", z.key)
# print(z.key)
# print(z.parent)
p = z.parent
# print(p.key)
# 1. zが子を持たない場合
if z.left is None and z.right is None:
# print('pattern 1')
if p.left == z:
p.left = None
else:
p.right = None
# 3. zが子を2つ持つ場合
elif z.left is not None and z.right is not None:
# print('pattern 2')
next_node = tree.get_next_node(z)
# print('next:', next_node.key)
z.key = next_node.key
self.delete(next_node)
# 2. zがちょうど1つの子を持つ場合
else:
# print('pattern 3')
# zが左子だった場合
if p.left.key == z.key:
if z.left is not None:
p.left = z.left
z.left.parent = p
else:
p.left = z.right
z.right.parent = p
else:
# zが右子だった場合
if z.left is not None:
p.right = z.left
z.left.parent = p
else:
p.right = z.right
z.right.parent = p
def get_next_node(self, node):
if node.right is not None:
# print('node right is not none')
return self.get_minimum(node.right)
p = x.parent
while p is not None and p != p.parent.left:
p = p.parent
return p.parent
def get_minimum(self, node):
x = node
# print('find1 :', x.key)
while x.left is not None:
x = x.left
# print('find2 :', x.key)
return x
def print_inorder(self):
self.inorder = []
self.inorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.inorder)))
def print_preorder(self):
self.preorder = []
self.preorder_traverse(self.root)
print(' ' + ' '.join(map(str, self.preorder)))
def inorder_traverse(self, node):
if node is None:
return
self.inorder_traverse(node.left)
self.inorder.append(node.key)
self.inorder_traverse(node.right)
def preorder_traverse(self, node):
if node is None:
return
self.preorder.append(node.key)
self.preorder_traverse(node.left)
self.preorder_traverse(node.right)
tree = Tree()
m = int(input())
for i in range(m):
line = input().split()
if line[0] == 'print':
# print('root', str(tree.root.key))
tree.print_inorder()
tree.print_preorder()
# print('root:(30)', tree.root.key)
# print('root.left(17):', tree.root.left.key)
# print('root.left.left(X):', tree.root.left.left.key)
# print('root.left.right(X):', tree.root.left.right.key)
# print('-----------------')
elif line[0] == 'insert':
key = int(line[1])
tree.insert(Node(key))
elif line[0] == 'find':
key = int(line[1])
if tree.find(key):
print('yes')
else:
print('no')
elif line[0] == 'delete':
# print("current tree----")
# print(tree.root.key)
# print(tree.root.left.key)
# print(tree.root.left.right.key)
# print(tree.root.left.right.parent.key)
# print("current tree----")
key = int(line[1])
# print('delete', str(key))
node = tree.find(key)
# print('node.key', node.key)
tree.delete(node)
# print('root.left.right:', tree.root.left.right.left.key)
# print('root:', tree.root.left.right.right.key)
| Traceback (most recent call last):
File "/tmp/tmpu0855l1b/tmphreyvbo1.py", line 136, in <module>
m = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s127995951 | p02285 | u567380442 | 1421931241 | Python | Python3 | py | Runtime Error | 30 | 6828 | 2327 | import sys
class Tree():
def __init__(self):
self.root = None
def insert(self, key):
z = Node(key)
y = None
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
self.root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def find(self, key):
x = self.root
while x and x.key != key:
if x.key < key:
x = x.right
else:
x = x.left
return x
def delete(self, key):
z = self.find(key)
y = successor(z) if z.left and z.right else z
x = y.left if y.left else y.right
if x:
x.parent = y.parent
if y.parent == None:
self.root = x
elif y == y.parent.left:
y.parent.left = x
else:
y.parent.right = x
if y != z:
z.key = y.key
def successor(x):
if x.right:
return minimum(x.right)
y = x.parent
while y and x == y.right:
x = y
y = y.parent
return y
def minimum(x):
while x.left:
x = x.left
return x
def print(self):
print('',' '.join(map(str, self.root.inwalk())))
print('',' '.join(map(str, self.root.prewalk())))
class Node():
def __init__(self, key):
self.key = key
self.parent = self.left = self.right = None
def prewalk(self):
ret = [self.key]
if self.left:
ret += self.left.prewalk()
if self.right:
ret += self.right.prewalk()
return ret
def inwalk(self):
ret = []
if self.left:
ret += self.left.inwalk()
ret += [self.key]
if self.right:
ret += self.right.inwalk()
return ret
tree = Tree()
n = sys.stdin.readline()
for line in sys.stdin:
if line[0] == 'i':
tree.insert(int(line.split()[1]))
elif line[0] == 'f':
print('yes' if tree.find(int(line.split()[1])) else 'no')
elif line[0] == 'd':
tree.delete(int(line.split()[1]))
else:
tree.print() | ||
s713087730 | p02285 | u882992966 | 1442416090 | Python | Python3 | py | Runtime Error | 20 | 7804 | 5041 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_8_A&lang=jp
# cat alds1_8_c.txt | ./alds1_8_c.py
import sys
class Node(object):
def __init__(self, key=None, parent=None):
self.key = key
self.parent = parent
self.left = None
self.right = None
def insert(key, node):
"""
??????????????????????????????, ???????????°???????????? node.left ????????? node.right ?????????????????????
"""
if key < node.key:
if node.left is None:
left_node = Node(key, node)
node.left = left_node
else:
insert(key, node.left)
else:
if node.right is None:
right_node = Node(key, node)
node.right = right_node
else:
insert(key, node.right)
def find(key, node):
"""
??????????????????????????????, ?????????????????¨????????°?????????????????????????????´?????????
????????????????????§??????????????????????????????????????¨??????????????° None ????????????
"""
if key == node.key:
return node
elif key < node.key:
if node.left is None:
return None
else:
return find(key, node.left)
else:
if node.right is None:
return None
else:
return find(key, node.right)
def print_preorder(node):
print(" %d" % node.key, end="")
if node.left is not None:
print_preorder(node.left)
if node.right is not None:
print_preorder(node.right)
def print_inorder(node):
if node.left is not None:
print_inorder(node.left)
print(" %d" % node.key, end="")
if node.right is not None:
print_inorder(node.right)
def search_minimum_node(node):
"""
node ???????????¨??????(??¨???)??¨??????????°????????????????????????????????????????
?????? node ??????????????±????????´??? leaf ?????¢?´¢??????????????§?????????
"""
if node.left is not None:
return search_minimum_node(node.left)
else:
return node
def delete(node):
if node.left is None and node.right is None:
# ?????? node ??????????????§, ?????? parent ???????????§??§????????????????????????
if node.parent.left is node:
node.parent.left = None
else:
node.parent.right = None
elif node.left is None and node.right is not None:
# node ??????????????????????????§, node ????????? node ????????????????????§?????????????????????
# node ??????????????? node ???????????????????????¨???????????§?????????????????????
if node is node.parent.left:
# node ?????????????????????
node.parent.left = node.right
else:
# node ?????????????????????
node.parent.right = node.right
node.right.parent = node.parent
elif node.left is not None and node.right is None:
# node ??????????????????????????§, node ????????? node ????????????????????§?????????????????????
# node ??????????????? node ???????????????????????¨???????????§?????????????????????
if node is node.parent.left:
# node ?????????????????????
node.parent.left = node.left
else:
# node ?????????????????????
node.parent.right = node.left
node.leftt.parent = node.parent
else:
# ????????????????????????????????????
# ?¬??????? (successor) ????¨??????????
successor = search_minimum_node(node.right)
if successor.right is not None:
# ??????????¬???????????????´??? node ???????????´???, ?????????????????????????????????
successor.right.parent = successor.parent
successor.parent.left = successor.right
else:
# ?¬???????????????´??? node ???????????´???, ?¬????????????????????????????????????????
successor.parent.right = None
# node ??????????¬???????????????§???????????????
node.key = successor.key
def main():
lines = sys.stdin.readlines()
root = Node()
for order in lines[1:]:
if order.startswith("insert"):
_, key = order.strip().split(" ")
key = int(key)
if root.key is None:
root.key = key
else:
insert(key, root)
elif order.startswith("find"):
_, key = order.strip().split(" ")
fild_result = "no" if find(int(key), root) is None else "yes"
print(fild_result)
elif order.startswith("print"):
print_inorder(root)
print("")
print_preorder(root)
print("")
elif order.startswith("delete"):
_, key = order.strip().split(" ")
node = find(int(key), root) # ????????§ node ???????????????????????£?????¨???????????????????§???§????????????
delete(node)
if __name__ == "__main__":
main() | ||
s111020150 | p02285 | u669284080 | 1446889127 | Python | Python | py | Runtime Error | 10 | 6620 | 2403 | from __future__ import print_function
from sys import stdin
class Node:
def __init__(self, id):
self.id = id
self.left = None
self.right = None
self.parent = None
def preorder_tree_walk(root):
print('', root.id, end='')
if root.left != None:
preorder_tree_walk(root.left)
if root.right != None:
preorder_tree_walk(root.right)
def inorder_tree_walk(root):
if root.left != None:
inorder_tree_walk(root.left)
print('', root.id, end='')
if root.right != None:
inorder_tree_walk(root.right)
def insert(root, z):
y = None
x = root
while isinstance(x, Node):
y = x
if z.id < x.id:
x = x.left
else:
x = x.right
z.parent = y
if y == None:
root = z
elif z.id < y.id:
y.left = z
else:
y.right = z
return root
def find(root, x):
while root != None and x != root.id:
if x < root.id:
root = root.left
else:
root = root.right
return root
def delete(root, z):
# detect delete node y.
if z.left == None or z.right == None:
y = z
else:
y = get_successor(z)
# detect y's child x
if y.left != None:
x = y.left
else:
x = y.right
if x != None:
x.parent = y.parent
if y.parent == None:
root = x
elif y == y.parent.left:
y.parent.left = x
else:
y.parent.right = x
if y != z:
z.id = y.id
def get_successor(x):
if x.right != None:
return get_minimum(x.right)
y = x.parent
while y != None and x == y.right:
x = y
y = y.parent
return y
def get_minumum(x):
while x.left != None:
x = x.left
return x
n = int(raw_input())
root = None
for i in xrange(n):
cmd = stdin.readline()
if cmd.startswith('i'):
num = int(cmd[7:])
root = insert(root, Node(num))
elif cmd.startswith('p'):
inorder_tree_walk(root)
print()
preorder_tree_walk(root)
print()
elif cmd.startswith('d'):
num = int(cmd[7:])
node = find(root, num)
if node != None:
delete(root, node)
else:
# find
num = int(cmd[5:])
if find(root, num) != None:
print('yes')
else:
print('no')
| Traceback (most recent call last):
File "/tmp/tmpx68huxpz/tmpz28x5fdh.py", line 94, in <module>
n = int(raw_input())
^^^^^^^^^
NameError: name 'raw_input' is not defined
| |
s136709154 | p02285 | u881590806 | 1449657318 | Python | Python | py | Runtime Error | 10 | 6372 | 2406 | def insert(tree,k):
y = None
x = tree
z = {'key':k, 'parent':None, 'left':None, 'right':None}
while x != None:
y = x
if x['key'] > k:
x = x['left']
else:
x = x['right']
z['parent'] = y
if y == None:
tree = z
elif y['key'] > k:
y['left'] = z
else:
y['right'] = z
return tree
def delete_leaf(p,x):
if left(p,x):
p['left'] = None
else:
p['right'] = None
return p
def delete_half_leaf(p,x,y):
if left(p,x):
p['left'] = y
else:
p['right'] = y
y['parent'] = p
return p
def left(p,x):
if p['left'] != None and p['left']['key'] == x['key']:
return True
else:
return False
def delete_internal(p,x):
y = x['right']
while y['left'] != None:
y = y['left']
x['key'] = y['key']
if y['right'] == None:
tree = delete_leaf(tree,y['parent'],y)
else:
tree = delete_half_leaf(tree,y['parent'],y,y['left'])
return p
def delete(tree,k):
x = find(tree,k)
if x == None: return
p = x['parent']
if p == None:
pass
else:
if x['left'] == x['right'] == None:
p = delete_leaf(p,x)
elif x['right'] == None:
p = delete_half_leaf(p,x,x['left'])
elif x['left'] == None:
p = delete_half_leaf(p,x,x['right'])
else:
p = delete_internal(p,x)
return tree
def find(tree,k):
x = tree
while x != None:
if x['key'] == k:
return x
elif x['key'] > k:
x = x['left']
else:
x = x['right']
return None
def middleorder(x):
if x != None:
middleorder(x['left'])
print x['key'],
middleorder(x['right'])
def preorder(x):
if x != None:
print x['key'],
preorder(x['left'])
preorder(x['right'])
tree = None
m = int(raw_input())
for i in range(m):
c = raw_input().strip()
if c[0] == 'i':
tree = insert(tree, int(c[7:]))
elif c[0] == 'f':
x = find(tree, int(c[5:]))
if x == None:
print "no"
else:
print "yes"
elif c[0] == 'd':
tree = delete(tree, int(c[7:]))
elif c[0] == 'p':
print '',
middleorder(tree)
print
print '',
preorder(tree)
print | File "/tmp/tmp6_dui1_f/tmp_95utzeh.py", line 84
print x['key'],
^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.