Using the list of links in system programming

despite having so many efficient data structures, why is only a linked list used so heavily in system programming? Is it because it allows the least use of heap code / less buggy?

Regards, Pwn

+3
source share
8 answers

A linked list is a very efficient data structure used for something like a queue or stack, where you want to add something at the end or delete it from the very beginning. System programming has a lot to do with queues and stacks.

+4
source

, . .

( , ) ( , ).

. ( ) .

+3

:

  • ( )
  • , , , , .
  • ( )
  • ,

, . , , , , .

- , / ?

. .

+3

, , , -, .

+1

- , , , , , , - FIFO, .

+1

, , -, / / node, , .

, , , , , , "" .

, , .

0

, . , . , , - , , , , ..

, . , .

0

(, -). , , .

0

Source: https://habr.com/ru/post/1747885/


All Articles