Hi Beth,
You are right that the underlying tree structure is the same in both RadixTree and InvertedRadixTree. But as you've probably seen with issue 6, the traversal algorithms are quite different.
Originally I kept them separate for testing purposes. When I was writing InvertedRadixTree I wanted it alone to give 100% coverage over the shared code (because it used the shared code differently). But now looking at how it turned out, it's absolutely possible to keep doing that, and have InvertedRadixTree extend the public interface of RadixTree.
So I've added the required shim methods in InvertedRadixTree, so you can now use that tree for both use cases. It's released as 2.2.0. This was a good suggestion! Thanks for this suggestion, and for the patch in issue 6 also. 2.2.0 contains this change and your patch.
Niall