First structure and classes of radix tree + first prototype of 'insert' method.
Clears value when a nodes get splitted and is no longer _real. Insertion uses key as value, if value is empty.
Adds first implementation of 'find' functionality.
Adds better error handling. 'find' method returns the node which matches the search key. Adds some code documentation.
Updates RadixTree Test to check for memory leak (loop).
Adds "remove node" functionality.
Uses RadixTreeNodeTraversalHelper classes instead of function pointer callbacks.
Updates API documentation.
Adds prefix search functionality.
Updates tree benchmarks + unit tests.
Linux fixes.