Crate treez

Modules

backtrack
bit
dsu
lower_bound
prefix
queue_monotone	monotonic queue items are ordered such that all elements are non-decreasing compared using cmp::Ordering::Less (eg: e_i >= e_j, for all i > j)
rb
scc
segmax
segsum
treap	treap implementation based from various references such as: http://e-maxx.ru/algo/treap Fast Set Operations Using Treaps: http://www.cs.cmu.edu/afs/cs.cmu.edu/project/scandal/public/papers/treaps-spaa98.html
upper_bound