This B-tree implementation includes algorithms to add, search and delete values from a B-tree. It was inspired by this Wikipedia article: https://en.wikipedia.org/wiki/Btree
Searching within nodes is done using binary search (using the bisect module).
Copyright (c) 2014 Robert Zavalczki, distributed under the terms and conditions of the Lesser GNU General Public License version 2.1