  We introduce an abstract framework for forcing over a free Suslin tree with
suborders of products of forcings which add some structure to the tree using
countable approximations. The main ideas of this framework are consistency,
separation, and the Key Property. We give three applications of this framework:
specializing derived trees of a free Suslin tree, adding uncountable almost
disjoint subtrees of a free Suslin tree, and adding almost disjoint
automorphisms of a free Suslin tree. Using the automorphism forcing, we
construct a model in which there is an almost Kurepa Suslin tree and a
non-saturated Aronszajn tree, and there does not exist a Kurepa tree. This
model solves open problems due to Bilaniuk, Moore, and Jin and Shelah.
