Antonio Kam anto [at] berkeley [dot] edu
anto [at] berkeley [dot] edu
teaching.rouxl.es
repr
str
class Link: empty = () def __init__(self, first, rest = Link.empty): assert rest is Link.empty or isinstance(rest, Link) self.first = first self.rest = rest
first
label
rest
branches
Note to Anto: Draw box-and-pointer diagram
s = Link(1, Link(2, Link(3))) >>> s.first 1 >>> s.rest Link(2, Link(3)) >>> s.rest.first 2 s2 = Link(1, 2) # This will error because rest is not a linked list >>> s.rest.rest.first 3
links.rouxl.es/disc
Tree
list
[]
class Tree: # simplified version compared to the 61A implementation def __init__(self, label, branches = []): assert type(branches) == list for item in branches: assert isinstance(item, Tree) self.label = label self.branches = branches
Construction: Tree(2); Tree(2, [Tree(3), Tree(4)])
Tree(2)
Tree(2, [Tree(3), Tree(4)])
Note that the branches must be in a list.
t = Tree(3, [Tree(4, [Tree(5)]), Tree(6)]) >>> t.label 3 >>> t.branches [Tree(4, [Tree(5)]), Tree(6)]
def constant(n): for i in range(50): print(50)
n
50
def log(n): while n > 0: print(n % 10) n //= 10
def linear(n): while n > 0: print(n) n -= 1
def quadratic(n): for i in range(n): for j in range(n): print(i + j)
def exponential(n): assert n >= 0 and type(n) == int if n == 0 or n == 1: return n else: return exponential(n - 1) + exponential(n - 2)
links.rouxl.es/feedback
Thanks for coming!
Please give me feedback on what to improve!