Files
leetcode/apps/docs/content/(03-hierarchical)/heap-priority-queue/index.mdx
T

6 lines
155 B
Plaintext

---
title: Heap / Priority Queue
description: 'The largest or smallest item is always at the top, and it is removed in logarithmic time.'
hidden: true
---