Btrees - Binary trees using the AVL balancing method. River stage zero No dependents

Btrees uses the AVL balancing method, by G. M. Adelson-Velskii and E.M. Landis. Bit scavenging, as done in low level languages like C, is not used for height balancing since this is too expensive for an interpreter. Instead the actual height of each ...

RSQUIERS/Btrees-1.00 - 26 Oct 2001 07:34:49 UTC
1 result (0.043 seconds)