Re: Other tree representations in SQL

> > The 5040 different transversals are here:
> >
> > Tree { N };
>
> No.

Yes :)

> The process of visiting all nodes is "traversal" without "ns".

What is "ns"?

> Since your solution is not a Tree, because it does not differentiate
> between preceding and subsequent nodes, it can not be traversed.

Preceding and subsequent?

Show me a tree definition containing that words.

My example is a relational representation of a simple hierarchy.

> "Tree {N}" does nothing at all.

Of course it does someting. It returns the set of all the nodes, and the user can transverse the set in all of the ways he wants.

Alfredo Received on Sat Dec 07 2002 - 17:02:55 CET