On Tue, 16 Jul 2002, Devrim GUNDUZ wrote:
You need to identify your problem: preorder traversal on a tree
using pointers for the fathers.
Then you have to prove (or prove the opposite) that SQL alone
is capable of expressing what you need.
BTW, Nested Sets are only good for "static" databases.
P
Devrim,
> Today, one of my teacher asked me a question for a practice... I could not
> solve it :)
>
> Here it comes:
>
> We are given the name of the grandfather in a family. Let's call him A. A
> has n sons, each son has children .
etc.
In a month or so, I will be posting an article on ad
Hi,
Today, one of my teacher asked me a question for a practice... I could not
solve it :)
Here it comes:
We are given the name of the grandfather in a family. Let's call him A. A
has n sons, each son has children .
for example.
A -> Grandfather
/ \
