# Adaptive Radix Tree

## Basic idea

A radix tree whose internal nodes adapt their fan-out (4/16/48/256) to actual key density at each level. Keeps the cache-friendliness of dense arrays for hot nodes while bounding memory for sparse ones. Comparable to hash tables but ordered.

## Key formulas

* Lookup/insert/delete: $O(k)$ where $k$ is key length in bytes (independent of $n$)
* Space: $O(n \cdot k)$ worst-case, much less in practice
* Node sizes: 4 / 16 / 48 / 256 entries


---

# 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/adaptive_radix_tree.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.