On Aug 21, 7:41 pm, castironpi <[EMAIL PROTECTED]> wrote:
> On Aug 21, 6:43 pm, castironpi <[EMAIL PROTECTED]> wrote:
>
> > Hi,
>
> > I am copying the GNU Avl Tree library in another language (Python). I
> > am adding 'up'-links, which I need for my application, and allowing
> > multiple equivalent keys. So far, my implementation won't work for
> > long before entering a recursive loop on printing.
>
> > I'm continuing to diagnose and look for the bug, but I thought I'd
> > appeal to the older and wiser. Anything to watch out for? I'll post
> > the code if necessary, but it will take more explanation.
>
> Ah, that's what PAVL stands for. I'll check it out and get back to
> you.
Success, thanks for your time. I feel that the line:
q = (struct pavl_node *) &tree->pavl_root;
in _4.5.2 Step 3: Update Balance Factors_ could use an explanation in
the docs, something like, 'because q.pavl_link[ 0 ] is the only
property ever read or set'. Otherwise it is definitely confusing.
_______________________________________________
gnu-misc-discuss mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/gnu-misc-discuss
