kuroko/bench/maketree.krk
2021-04-14 22:25:22 +09:00

15 lines
371 B
Python

class Node:
def __init__(self, left, right):
self.left = left
self.right = right
def makeTree(depth):
if depth <= 0: return Node(None,None)
let n1 = makeTree(depth-1)
let n2 = makeTree(depth-1)
return Node(n1,n2)
if __name__ == '__main__':
from timeit import timeit
print(timeit(lambda: makeTree(16), number=10), 'makeTree')