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 ]
Graham Cooper

Posts: 4,250
Registered: 5/20/10
Re: A tree with exactly one infinite path
Posted: Aug 22, 2013 4:53 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Wednesday, August 21, 2013 9:09:43 PM UTC-7, 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.
>
>




Welcome to Functional Programming!

cons_node - cons_nodes consist of two pointers,
one to the head (first item)
the other to the rest of the list. They are the "glue" which
holds the list together. The list (A B C) would be stored as
------- -------- --------
| .| . |-----> | .| . |------> | .| . |---> NIL
--|----- --|------ --|-----
| | |
V V V
A B C



head( cons(a,b) ) = a
tail( cons(a,b) ) = b


They call this a list for some reason!


www.tinyurl.com/HOW-PROLOG-WORKS



Herc




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.