In article <9cc0cfec-2b6c-44de-89af-5a0968ee1a80@c1g2000vbw.googlegroups.com>, WM <mueckenh@rz.fh-augsburg.de> wrote:
> On 31 Okt., 15:38, Gus Gassmann <horand.gassm...@googlemail.com> > wrote: > > On Oct 31, 10:06 am, Brian Chandler > > > But there is another, more direct way of proceeding: You can list the > > paths, and those are all the paths you are going to consider. > > It is difficult to list an infinite set, however. > > > No > > combining of paths into other paths. And in that case, the path > > 1-3-7-15-... is not among those listed.- Zitierten Text ausblenden - > > You see, one might add, that you cannot discern from the nodes whether > or not the finished infinite paths are there.
But for any subset of N = {1,2,3,...}, finite or infinite, there is a path in any Complete Infinite Binary Tree having that set as the set of levels at which the path branched left, and another path having that set as the levels at which the path branched right. --
