---
title: "Choosing a data structure by operation profile"
description: "How can you choose a structure by lookup, insertion, and ordering workload?"
status: "coming-soon"
language: "en"
canonical: "https://bulnik.dev/en/articles/topics/T54.10/"
topicId: "T54.10"
---

> Coming soon — this article is being prepared. Below are its question, intended outcome, and place in the story.

## The question

How can you choose a structure by lookup, insertion, and ordering workload?

## What we will work through

Choose a structure by lookup, insertion, and ordering workload.

## Before you begin

Previously covered: Hash tables and collision handling; Heaps and priority queues; Search trees.

- [Hash tables and collision handling](/en/articles/topics/T54.02/)
- [Heaps and priority queues](/en/articles/topics/T54.03/)
- [Search trees](/en/articles/topics/T54.04/)