Bintrees

* bug fixes
* status: 5 - Production/Stable
* removed useless TreeIterator() class and T.treeiter() method.
* patch from Max Motovilov to use Visual Studio 2008 for building C-extensions

* API change!!!
* full Python 3 support, also for Cython implementations
* removed user defined compare() function - keys have to be comparable!
* removed T.has_key(), use 'key in T'
* keys(), items(), values() generating 'views'
* removed iterkeys(), itervalues(), iteritems() methods
* replaced index slicing by key slicing
* removed index() and item_at()
* repr() produces a correct representation
* installs on systems without cython (tested with pypy)
* new license: GNU Library or Lesser General Public License (LGPL)

* added itemslice(startkey, endkey), keyslice(startkey, endkey),
valueslice(startkey, endkey) - slicing by keys
* tested with pypy 1.4.1, damn fast
* Pure Python trees are working with Python 3
* No Cython implementation for Python 3

* runs with Python 2.7

* low level functions written as c-module only interface to python is a cython
module
* support for the pickle protocol

* added delslice del T[0:3] -> remove treenodes 0, 1, 2
* added discard -> remove key without KeyError if not found
* added heap methods: min, max, nlarges, nsmallest ...
* added Set methods -> intersection, differnce, union, ...
* added slicing: T[5:10] get items with position (not key!) 5, 6, 7, 8, 9
T[5] get item with key! 5
* added index: T.index(key) -> get position of item <key>
* added item_at: T.item_at(0) -> get item at position (not key!) 0
T.item_at(0) O(n)! <==> T.min_item() O(log(n))