[Python-Dev] Google Summer of Code proposal: New class for work with binary trees AVL and RB as with the standard dictionary. (original) (raw)
Hye-Shik Chang hyeshik at gmail.com
Tue Apr 25 05:06:16 CEST 2006
- Previous message: [Python-Dev] Google Summer of Code proposal: New class for work with binary trees AVL and RB as with the standard dictionary.
- Next message: [Python-Dev] Google Summer of Code proposal: New class for work with binary trees AVL and RB as with the standard dictionary.
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On 4/25/06, Josiah Carlson <jcarlson at uci.edu> wrote:
There exists various C and Python implementations of both AVL and Red-Black trees. For users of Python who want to use AVL and/or Red-Black trees, I would urge them to use the Python implementations. In the case of needing the speed of a C extension, there already exists a CPython extension module for AVL trees: http://www.python.org/pypi/pyavl/1.1
And a C implementation for redblack tree is here: http://python.org/sf/1324770
:)
Hye-Shik
- Previous message: [Python-Dev] Google Summer of Code proposal: New class for work with binary trees AVL and RB as with the standard dictionary.
- Next message: [Python-Dev] Google Summer of Code proposal: New class for work with binary trees AVL and RB as with the standard dictionary.
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]