It's a micro optimization. Default values are evaluated only once at function definition time, and locals (including parameters) are a bit faster to access than globals, they're implemented as a C array lookup instead of a dict lookup. It also allows avoiding repeatedly looking up the heappush and heappop members of heapq, without polluting the namespace by pulling them in directly.
Timeit snippets:
python -mtimeit --setup "import heapq" --setup "def f(q,x,p=heapq.heappush): p(q,x)" "f([], 1)"
1000000 loops, best of 3: 0.538 usec per loop
python -mtimeit --setup "import heapq" --setup "def f(q,p=heapq.heappop): p(q)" "f([1])"
1000000 loops, best of 3: 0.386 usec per loop
python -mtimeit --setup "import heapq" --setup "def f(q,x): heapq.heappush(q,x)" "f([], 1)"
1000000 loops, best of 3: 0.631 usec per loop
python -mtimeit --setup "import heapq" --setup "def f(q): heapq.heappop(q)" "f([1])"
1000000 loops, best of 3: 0.52 usec per loop