随笔分类 -  最大堆、最小堆

最大堆，最小堆：完全二叉树
摘要：插入删除的复杂度：log N 1.从根节点走到叶节点产生的序列一定是递增or 递减 in a min-heap, all the keys along the path from the root to any leaf node must be in sorted (non-decreasing) 阅读全文
posted @ 2022-12-12 00:05 noob-lian 阅读(35) 评论(0) 推荐(0) 编辑

Language:
点击右上角即可分享
微信分享提示