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
|
|
|
|
|
|
|
|
* [Doubly linked list](https://github.com/0xAX/linux-insides/blob/master/DataStructures/dlist.md)
|
2015-05-16 11:44:52 +00:00
|
|
|
* [Radix tree](https://github.com/0xAX/linux-insides/blob/master/DataStructures/radix-tree.md)
|
2016-02-28 14:16:33 +00:00
|
|
|
* [Bit arrays](https://github.com/0xAX/linux-insides/blob/master/DataStructures/bitmap.md)
|
