initial implementation

Initial implementation of B+ tree.  As of now, only the find works
reliably.
finish insert method

Finished the insert method.  Need to verify that find works.  Doesn't
seem to be working very well now.
implement a binary search for nodes

the bisect module doesn't seem to like arbitrary objects.  Reimplemented
bisect.bisect in pure python  that appears to behave much better.
initial implementation

Initial implementation of B+ tree.  As of now, only the find works
reliably.
finish insert method

Finished the insert method.  Need to verify that find works.  Doesn't
seem to be working very well now.
implement a binary search for nodes

the bisect module doesn't seem to like arbitrary objects.  Reimplemented
bisect.bisect in pure python  that appears to behave much better.
Merge branch 'btree' of github.com:ayr0/numerical_computing into btree
move lab to proper folder

This is an Algorithms lab.
Lab: Balanced Trees

Added balanced trees lab to Vol2
explain AVL balance cases

Use figures to illustrate the balancing cases for an AVL tree.  Added
problem to implement balancing on a BST (from the Data Structures lab).
Merge branch 'develop' into btree

Conflicts:
	Vol2.tex
explain insert for B-Tree

Explained how do node splitting on inserts

Also talked about how balanced trees are structured and why.
remove b-tree implementation

Remove incomplete B-tree code.  Coding a working B-Tree far exceeds the
time requirement of the lab.  We instead have them illustrate find,
insert, and remove on B-Trees.
Add explanation of removal in B-Tree

Added some ready-made trees for the Btree problem
expand explanations

Explain the concept of height better.

Also, added a reset to reset the numbering of footnotes each chapter.
Removed \centering commands because they are not needed (we
automatically center any figure environment).
Merge branch 'btree' of git://github.com/ayr0/numerical_computing into ayr0-btree

Conflicts:
	include.tex