"LudovicoVan" <julio@diegidio.name> wrote in message news:jougci$3na$1@speranza.aioe.org...
> We will use a so called depth-first search to enumerate the nodes. To > each node we associate one and only one infinite path by way of > considering the path along a straight direction (which can be encoded as a > period, i.e. "(0)" or "(1)") from the given node: to the left if the node > is odd (i.e. it is 1) at an odd level of the tree, or even (i.e. it is 0) > at an even level of the tree; otherwise to the right (the node is even at > an odd level or odd at an even level). IOW, go down left if the parity of > the node matches that of its tree level, go right otherwise - 'R' is > considered even.
That is not correct, it is actually simpler than that: take right from any '0' and left from any '1'; consider 'R' odd (i.e. take left). Anyway that does not change the substance of the argument.
