# Data Structures in the Linux Kernel

Linux kernel provides different implementations of data structures like doubly linked list, B+ tree, priority heap and many many more.

This part considers the following data structures and algorithms:

* [Doubly linked list](https://0xax.gitbook.io/linux-insides/summary/datastructures/linux-datastructures-1)
* [Radix tree](https://0xax.gitbook.io/linux-insides/summary/datastructures/linux-datastructures-2)
* [Bit arrays](https://0xax.gitbook.io/linux-insides/summary/datastructures/linux-datastructures-3)