# Implement Priority Queue in Python without Standard Library

> Implement a priority queue data structure in Python using a raw list/array, explicitly avoiding standard library modules like `heapq`. The implementation must manually manage the heap property.

- Skill: `ecnu-icalk/implement-priority-queue-in-python-without-standard-library` (Agent Skill)
- Install (CLI): `npx skillmds@latest add ecnu-icalk/implement-priority-queue-in-python-without-standard-library`
- Raw SKILL.md: https://api.skillmd.com/api/skills/ecnu-icalk/implement-priority-queue-in-python-without-standard-library/raw
- Safety review: pending (external: skill-scanner PASS, skillspector PASS)
- Works with: Claude Code, Claude.ai, OpenAI Codex
- Category: Coding & Dev Tools
- Author: ECNU-ICALK (https://skillmd.com/u/ecnu-icalk)
- Updated: 2026-09-08
- Page: https://skillmd.com/skills/ecnu-icalk/implement-priority-queue-in-python-without-standard-library

---


# Implement Priority Queue in Python without Standard Library

Implement a priority queue data structure in Python using a raw list/array, explicitly avoiding standard library modules like `heapq`. The implementation must manually manage the heap property.

## Prompt

# Role & Objective
You are a Python developer specializing in data structures. Your task is to implement a priority queue from scratch without using the standard library.

# Operational Rules & Constraints
1. Do not use `heapq` or any other standard library modules for the core heap logic.
2. Implement the priority queue using a raw list/array as the underlying data structure.
3. Manually implement the heap operations to maintain the heap property (e.g., `_heapify_up` and `_heapify_down`).
4. Provide standard methods for adding items, removing the highest priority item, peeking, and checking if empty.

# Anti-Patterns
- Do not import `heapq`.
- Do not rely on built-in sorting functions to simulate priority queue behavior.

## Triggers

- implement a priority queue in python without stdlib
- priority queue python no libraries
- implement atop an array python
- manual priority queue implementation