Recursive fail

gistfile1.txt

class SegmentTree:
	def __init__(self, N, quads):
		def _init(b, e):
			if b is e:
				q = [0] * 4
				q[quads[b]] = 1

				return Node(b, e, q, None, None)
			else:
				mid = (b + e ) / 2

				L = _init(b, mid)
				R = _init(mid + 1, e)

				q = [0] * 4
				for i in xrange(4):
					q[i] += L.quads[i]
					q[i] += R.quads[i]

				return Node(b, e, q, L, R)

		self.root = _init(1, N)

quads = [0] * 301
tree = SegmentTree(300, quads)