2
A minimalist binary tree implementation
3
whose values are (descendants of) BTreeNodes.
4
This alleviates some typing difficulties when
5
using TimSort on lists of the form [(key, Thing), ...]
10
def __init__(self, key):
17
assert isinstance(key, int)
18
assert isinstance(val, BTreeNode)
32
def _values(self, dest):
34
self.left._values(dest)
37
self.right._values(dest)