RE: [PHP] building an admin tree with varying node types
| From: | Boyd, Todd M. | Date: | Thu, 13 Nov 2008 22:41:45 +0000 |
| Subject: | RE: [PHP] building an admin tree with varying node types | ||
| References: | 1 2 3 4 5 6 7 8 9 10 | Groups: | php.general |
| Request: | Send a blank email to php-general+get-283269@lists.php.net to get a copy of this message | ||
> -----Original Message-----
> From: Rene Veerman [mailto:rene7705@gmail.com]
> Sent: Thursday, November 13, 2008 4:06 PM
> To: Boyd, Todd M.
> Cc: php-general@lists.php.net
> Subject: Re: [PHP] building an admin tree with varying node types
>
> Rene Veerman wrote:
> > i'm still trying to get my head around how the operations are done.
> > sometimes i see that java app re-arrange large parts of the tree, and
> > i wonder if it's still the same tree i'm looking at :)
> >
> >
> omg, somebody grab the LART and give me a good spanking on the back of
> my head..
>
> a binary search tree cannot be used to store an actual tree of
> information, right? (just double checking)
>
> so far apparently all i got is a modified pre-order tree. I was told
> this is the same as a binary tree, and from there confusion set in
> quickly..
>
> so the search continues...
It is my understanding that a "binary tree" is any tree where each node can have a maximum
of 2 children. There are several implementations--they differ on how they are balanced, for the most
part.
HTH,
Todd Boyd
Web Programmer