Aryadev Chavali
55a24fc560
Just checks the value of the current node against value, assesses if the leaf it needs to store it in is a NULL or not, then either allocates to that leaf or recursively calls insert on that leaf (so it may sort the value). Uses pointer magic for some cleaner code.
Algorithms
Common algorithms in C/C++/Python depending on which one is the nicest/makes the most sense to use. This will include random maths stuff as well, such as making supporting mechanisms for, say, the use of group semantics.