에 위반되므로 해당 엔트리를 단순히 제거할 수는 없다. 다행히도, 가장 꼭대기에 있는 엔트리
를 제거하고 효율적으로 최대 이진 힙을 재구성할 수 있는
dequeue
()
전략이 있다. 다음과 같
은 일련의 과정을 거친다.
1. 가장 밑바닥 레벨의 가장 우측에 있는 엔트리를 제거하고 저장한다. 그 시점에는 힙 순서와 힙 모양 속
성 모두를 만족할 것이다.
2. 레벨
0
에서 가장 우선순위가 높은 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.