Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: A tree with exactly one infinite path
Replies: 8   Last Post: Aug 24, 2013 12:24 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
William Elliot

Posts: 1,520
Registered: 1/8/12
Re: A tree with exactly one infinite path
Posted: Aug 22, 2013 4:13 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Wed, 21 Aug 2013, Virgil wrote:

> Consider the binary tree in which every right child has a child and
> every left child is a terminal node.
>
> Then there is in it for each member of |N a left terminal node having
> that path length, and an infinite path of all right nodes to represent
> the set |N itself, having one node at each length in |N.


Creepy. An infinitely long centipede with only left legs.

Consider a trinary tree in which every middle child has a child
and every left and right child is a terminal node.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.