Re: All paths through a tree
- From: rc@xxxxxxxxxxxx
- Date: Wed, 27 Sep 2006 13:16:48 -0400
Blaine wrote:
Given a tree like:
(77 (237 (228 (234 (231 266) 266)) (234 (231 266) 266)))
Can you explain what makes this a tree? (as opposed to a list of lists)
What is the single data structure that makes it a tree?( what is a node)
Is a node of the tree a tree itself?
Define these terms and you can design traversal algorithm.
I would like to list all the paths from the source node to the terminal.
nodes:
((77 237 228 234 231 266)
(77 237 228 234 266)
(77 237 234 231 266)
(77 237 234 266))
I've been struggling with this for a few days now, and I just can't get
it to work. Does anyone have any ideas? Anywhere to look for code for
manipulating trees?
Thanks, Blaine
- References:
- All paths through a tree
- From: Blaine
- All paths through a tree
- Prev by Date: Re: [CLOS] Ensuring a method exists
- Next by Date: Re: (read-from-string "#.(values) 42")
- Previous by thread: All paths through a tree
- Next by thread: Re: All paths through a tree
- Index(es):