Time test: min leftist tree vs binomial heap.
Note that there may be memory leaks which I have not taken care of, and the programming may not be best practice, however I believe this code is easy to follow with the wiki of each data structure and it is well commented for beginners to understand.
There also are some errors in the leftist tree and binomial heap (likely due to updating pointers and memory de-allocation) which I have not fixed yet.