 For this reason the procedure should be understood as applying all steps in parallel, with the resulting tree given "in the limit" of applying the procedure infinitely.For example, the procedure does not grow trees at all for BT() or for BT(), which corresponds to a single unlabeled root node.Similarly, the procedure does not terminate for BT(), but the tree is nonetheless different from the former examples.