59
拜托，面试别再问我堆（排序）了！
source link: https://juejin.im/post/5cba5cb9518825327e23f078
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
何为堆？ 堆是一种特殊的树，只要满足下面两个条件，它就是一个堆： （1）堆是一颗完全二叉树； （2）堆中某个节点的值总是不大于（或不小于）其父节点的值。 其中，我们把根节点最大的堆叫做大顶堆，根节点最小的堆叫做小顶堆。 堆详解 满二叉树 满二叉树是指所有层都达
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK