  We show how a Monte Carlo method for generating self-avoiding walks on
lattice geometries which employs a binary-tree data structure can be adapted
for hard-sphere polymers with continuous degrees of freedom. Data suggests that
the time per Monte Carlo move scales logarithmically with polymer size. We
combine the method with a variant of the Metropolis algorithm and preserve this
scaling for Lennard-Jones polymers with untruncated monomer-monomer
interaction. We further show how the replica-exchange method can be adapted for
the same purpose.
