The heap.png image in the readme (https://raw.githubusercontent.com/kdn251/interviews/master/images/heap.png) shows a tree that does indeed respect the heap order property. The problem is when you mention the time complexities. In order to have O(log(n)) insert / remove time you also need for your heap to be a complete binary tree. The heap in the picture is not a complete binary tree. I think it

Hey Yangshun,
Thanks for the great list of guides!

I found the explanation for Snake game bit difficult to follow and I came across this interesting and better explanantion here https://www.youtube.com/watch?v=AaGK-fj-BAM

为了更加方便大家在线阅读，我目前已经将项目发布在 GitHub Page 上，阅读请点我。

另外，大家如果有转载的需求，请注明出处，毕竟我花了大量的时间整理了这一系列知识。

Reference

Mistune has a new version that supports more fancy formatting (for instance, alignment on Markdown tables). It is a breaking upgrade, but we should upgrade nonetheless.

Want to work on this issue?

Yes

The API is well-defined in the code, but it would be nice to have it in ReadTheDocs.
It would also allow us to add bits of useful information, such as the fact that #470 exists.