AVL and hash in mm
Koshelev Maximka (iloveselfme@hotmail.com)
Mon, 21 Sep 1998 22:54:21 PDT
I only whant to say that ordinary AVL tree may be more faster if
we divide it on many (100-200) trees. New trees will have small size
and, hence, have small balansing cost. Since access to top of tree
is only operation of getting one element from array. And tree have much
smaller size. Thereby we will be have better perfomance.
-------------- MAX
[]_\
[] /
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/