You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
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://github.com/0xAX/linux-insides/blob/master/DataStructures/dlist.md)
|
|
|
|
|
* [Radix tree](https://github.com/0xAX/linux-insides/blob/master/DataStructures/radix-tree.md)
|
|
|
|
|
* [Bit arrays](https://github.com/0xAX/linux-insides/blob/master/DataStructures/bitmap.md)
|
