transport: use red-black tree instead of binary heap
transport: use red-black tree instead of binary heap

The current implementation of the binary heap uses an array.
Inserting into the heap can be O(n) when the array is full and
needs to be resized.

Until the binary heap is implemented with pointers, the multiplexer
is going to rely on the red-black tree.

Signed-off-by: Sébastien Boisvert <1a4d2e25eb5ba040b6ad5779a730a1a8a0ff9bc5@anl.gov>

sebhtml/biosal,GeneAssembly/biosal,sebhtml/biosal,GeneAssembly/biosal,sebhtml/biosal,GeneAssembly/biosal,GeneAssembly/biosal,GeneAssembly/biosal,sebhtml/biosal,sebhtml/biosal,GeneAssembly/biosal,sebhtml/biosal