This is the first part of identity carry over where we abstract the RBTree to not care about the datatypes stored as long as the key is sortable via a Compare function it will create a RBTree.
This will help in later stages where the keytype will be a struct with more data points instead of a string.
This is the first part of identity carry over where we abstract the RBTree to not care about the datatypes stored as long as the key is sortable via a Compare function it will create a RBTree.
This will help in later stages where the
keytypewill be a struct with more data points instead of a string.