Is there a canonical notation for tree structure?
I never am sure how to show or talk about a tree.
a
\
b
|
c
|
d
a is parent to b, c and d.
b,c and d are siblings
If the focus is on b, I want the result (b)
If the focus is on c, I want the result (c, b)
if the focus is on c, I want the result (d, c, b)
That's what I mean by "siblings above"
The next step will be to repeat the process "going up" to the root:
a
\
b
|
c- x-y-z
| |
d p
|
q
|
r
In above, if focus is on q, I want result
(q, p, y, x, c, b, a)
Thanks,
Kent
On
Mon, Mar 8, 2010 at 10:00 AM, TL <[email protected]> wrote:
>> I need to gather siblings above the node with focus.
>
> I assume this refers to the node's parent's siblings. Or perhaps we
> could just say the "node's aunts and uncles" :-)
>
> --
> You received this message because you are subscribed to the Google Groups
> "leo-editor" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/leo-editor?hl=en.
>
>
--
You received this message because you are subscribed to the Google Groups
"leo-editor" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/leo-editor?hl=en.
