2015-03-22 06:12:05 +00:00
|
|
|
Data Structures in the Linux Kernel
|
|
|
|
|
========================================================================
|
|
|
|
|
|
2015-10-05 15:41:10 +00:00
|
|
|
Linux kernel provides different implementations of data structures like doubly linked list, B+ tree, priority heap and many many more.
|
2015-03-22 06:12:05 +00:00
|
|
|
|
2015-10-05 15:41:10 +00:00
|
|
|
This part considers the following data structures and algorithms:
|
2015-03-22 06:12:05 +00:00
|
|
|
|
2018-03-14 19:08:23 +00:00
|
|
|
* [Doubly linked list](linux-datastructures-1.md)
|
|
|
|
|
* [Radix tree](linux-datastructures-2.md)
|
|
|
|
|
* [Bit arrays](linux-datastructures-3.md)
|
