In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> On 9 Jun., 20:50, Virgil <virg...@nowhere.com> wrote: > > > > > > All nodes are already used up. > > > > From every node issue at least two tails (actually uncountably many > > tails in every maximal infinite binary tree), and your method only > > involves one of them, so is incomplete. > > One of them belongs to a tail that has already been mapped on a node > at a higher level. The other is mapped on that actual node. That makes > a complete 1 to 1 mapping.
That accounts for only two paths out of uncountably many, so does not exhaust the paths. > > > > > And, what is more important, also > > > all combinations of nodes are used up. > > > > Then paths must not be what WM calls "combinations of nodes" as not all > > paths are "used up". > > At least all the constructed paths cover all nodes and leave no node > that could be used for another construction.
Only in infinite but not maximal binary trees in which some nodes have less than two children. > > Regards, WM