Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

JavaScript Algorithms and Data Structures 源码分析(7) -- 堆 Heap | 会飞的菜虫 #10

Open
FlyingCaiChong opened this issue Dec 14, 2023 · 0 comments

Comments

@FlyingCaiChong
Copy link
Owner

http://flyingcc.cn/2023/11/24/data-structures-007-Heap/

堆 (数据结构)在计算机科学中, 一个 堆(heap) 是一种特殊的基于树的数据结构,它满足下面描述的堆属性。 在一个 最小堆(min heap) 中, 如果 P 是 C 的一个父级节点, 那么 P 的 key(或 value)应小于或等于 C 的对应值.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant