Basically, a self-balancing binary tree: https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
I can do the Java implementation :)
Sure. Go for it 馃憤
Can I try to implement this in C++ ? @AdiChat
Sure @RajatGarg97 Go for it 馃憤
I have a pure C implementation that works like a min-heap and has push and pop functions. I wouldn't mind contributing it.
Most helpful comment
Sure @RajatGarg97 Go for it 馃憤