A pure python binary tree class is provided. It is thoroughly unit tested, passes pylint, and is known to run on CPython 2.x, CPython 3.x, Pypy 2.4.0, Pypy3 2.4.0 and Jython 2.7b3.
This binary tree looks like a dictionary that’s always sorted by key. It does not reorganize itself.
Although definitely a poor choice for pre-sorted keys, it’s quite good for pre-randomized keys.
1 maintainer
Release files for binary_tree_dict_mod 1.0
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| binary_tree_dict_mod-1.0.tar.gz | 9.9 kB | Details |
Release files / binary_tree_dict_mod-1.0.tar.gz
| Download URL | binary_tree_dict_mod-1.0.tar.gz |
|---|---|
| Size | 9.9 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
4ead43559ac555a42f5d2f71eb97525e28f12ff990830290b049ccce0619e8fd
|
|
BLAKE2b-256 checksum How to use checksums |
66a4855740054eab07ec6844520fd4fb33291d7f8e844b46e537490ab968e20d
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
