# Pairing heaps

## Basic idea

A heap-ordered multiway tree whose operations are defined by simple, lazy melding. Simpler and faster in practice than Fibonacci heaps, with surprisingly good (and still not fully analysed) amortised complexity.

## Key formulas

* find-min, insert, meld: $O(1)$
* decrease-key: $O(\log n)$ amortised (open: conjectured $o(\log n)$)
* delete-min: $O(\log n)$ amortised


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://isubasinghe.gitbook.io/isithas-wiki/computer_science/data_structures/pairing_heaps.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.