linked list - définition. Qu'est-ce que linked list
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est linked list - définition

DATA STRUCTURE WHICH IS A LINEAR COLLECTION OF DATA ELEMENTS, CALLED NODES, EACH POINTING TO THE NEXT NODE BY MEANS OF A POINTER
Linked lists; Singly linked list; Circularly linked list; Singly-linked list; Linked List; Two-way list; Two-way linked list; Symmetrically linked list; Circular list; LinkedList; Tail sharing; Tail-sharing; Linked List in Pascal; Dynamic list; Circular linked list
  • Diagram of inserting a node into a singly linked list
  • Diagram of deleting a node from a singly linked list
  • A linked list is a sequence of nodes that contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list.

linked list         
<programming> A data structure in which each element contains a pointer to the next element, thus forming a linear list. A doubly linked list contains pointers to both the next and previous elements. (1995-03-28)
Linked list         
In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next.
doubly linked list         
LINKED LIST IN WHICH EACH NODE REFERENCES BOTH ITS SUCCESSOR AND ITS PREDECESSOR
Double linked list; Doubly-linked list
<programming> A data structure in which each element contains pointers to the next and previous elements in the list, thus forming a bidirectional linear list. (1995-03-28)

Wikipédia

Linked list

In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing more efficient insertion or removal of nodes at arbitrary positions. A drawback of linked lists is that access time is linear (and difficult to pipeline). Faster access, such as random access, is not feasible. Arrays have better cache locality compared to linked lists.

Linked lists are among the simplest and most common data structures. They can be used to implement several other common abstract data types, including lists, stacks, queues, associative arrays, and S-expressions, though it is not uncommon to implement those data structures directly without using a linked list as the basis.

The principal benefit of a linked list over a conventional array is that the list elements can be easily inserted or removed without reallocation or reorganization of the entire structure because the data items do not need to be stored contiguously in memory or on disk, while restructuring an array at run-time is a much more expensive operation. Linked lists allow insertion and removal of nodes at any point in the list, and allow doing so with a constant number of operations by keeping the link previous to the link being added or removed in memory during list traversal.

On the other hand, since simple linked lists by themselves do not allow random access to the data or any form of efficient indexing, many basic operations—such as obtaining the last node of the list, finding a node that contains a given datum, or locating the place where a new node should be inserted—may require iterating through most or all of the list elements.