On Wed, Mar 26, 2014, at 13:31, Marko Rauhamaa wrote: > > I have made a full implementation of a balanced tree and would like to > know what the process is to have it considered for inclusion in Python > 3. It's not a bad idea. (I believe others have proposed an red-black tree.) Certainly, it requires a PEP and a few months of bikesheding, though.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4