Question: Show that red-black BSTs are not memory less:
For case, if you insert a key that is smaller than all the keys in the tree and then immediately delete the minimum, you may get a different tree.
Can you please show that red-black BSTs are not memory less?