My understanding (somewhat limited), is that you would never want to use a radix sort with red-black trees, as a tree should already have some sorting to it as

My understanding (somewhat limited), is that you would never want to use a radix sort with red-black trees, as a tree should already have some sorting to it as is. Otherwise, why not just used a linked list? Besides, radix sorts are generally good for fixed-width data that has a known bound, like integers. Basically, this is made-up nonsense. It's good made-up nonsense though.