Subj : Re: binary search
To   : comp.programming
From : moi
Date : Fri Jul 29 2005 02:24 pm

Ben Pfaff wrote:

> We were starting from a sorted linked list.  Building a balanced
> binary search tree from a sorted linked list is easy.  I have a
> webpage on how to do it:
>         http://adtinfo.org/libavl.html/Transforming-a-Vine-into-a-Balanced-BST.html

Excellent stuff! BTW: is the word "vine" a standard naming for such a 
semi-degenerate binary three ?

AvK

.