# In-memory dictionary

DevFeed: [In-memory dictionary](<https://devfeed.tech/articles/in-memory-dictionary-39362.md>)

Original publisher: [Read original article](<https://kt.academy/article/pmem-in-memory-dictionary>)

Published: 2022-05-05T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [Data structures](<https://devfeed.tech/topics/data-structures.md>), [structure](<https://devfeed.tech/topics/structure.md>)

Tags: [complexity](<https://devfeed.tech/tags/complexity.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [hierarchy](<https://devfeed.tech/tags/hierarchy.md>), [node](<https://devfeed.tech/tags/node.md>), [search](<https://devfeed.tech/tags/search.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

## AI overview

This tutorial begins by building an in-memory dictionary as a step toward understanding persistent memory. It compares data-structure options and uses a Trie to support adding words, searching for words, and finding words with a given prefix, while introducing trees and Trie nodes.

## Source excerpt

Let's begin our journey to understand persistent memory by building an in-memory dictionary.