15 lines
394 B
Python
15 lines
394 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(min(timeit(lambda: makeTree(16), number=1) for x in range(10)), 'makeTree')
|