Linked list

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Export map as:

Research this topic

Explore the main themes, entities and connections around Linked list. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

History

Papyrus Reclamans Nominalized Mechanical printing of books Catchword

34 related topics

Tradeoffs

Dynamic array Fragmentation Amortized Sequential access Heapsort

29 related topics

Overview

Computer science Points Data structure Nodes Sequence

21 related topics

Linked list operations

Pseudocode Sentinel Array Records Parallel arrays

8 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Computer science
Points Pointer (computer programming)
Data structure
Nodes Node (computer science)
Sequence
Data Data (computing)
Reference Reference (computer science)
Linear Time complexity
Pipelining Instruction pipelining
Array Array data structure
Cache locality Locality of reference
Abstract data types Abstract data type
Lists List (abstract data type)
Stacks Stack (abstract data type)
Queues Queue (abstract data type)
Associative arrays Associative array
S-expressions S-expression
Run-time Run time (program lifecycle phase)
Random access
Asymptotic time complexity
Append

Basic concepts and nomenclature

Lisp Lisp (programming language)
Cdr CAR and CDR
XOR-linking XOR linked list
Rootkits
Null Null pointer
List
Memory address

Tradeoffs

Dynamic array
Fragmentation Fragmentation (computer)
Amortized Amortized analysis
Sequential access
Heapsort
Characters Character (computing)
Boolean values Boolean value
Memory pools Memory pool
Unrolled linked lists Unrolled linked list
CDR coding
Josephus problem
List ranking
Parallel algorithm
Balanced tree Self-balancing binary search tree
AVL trees AVL tree
Red–black trees Red–black tree
Recursive Recursion
Merging Merge algorithm
Iterative commands Iteration
Tail-sharing
Persistent data structures Persistent data structure
Polygon
Buffers Data buffer
FIFO FIFO (computing and electronics)
Time-shared Time sharing
Round-robin order Round-robin scheduling
Quad-edge Quad-edge data structure
Face-edge Face-edge data structure?action=edit&redlink=1
Well-known method Cycle detection

Linked list operations

Pseudocode
Sentinel Sentinel value
Array Array data type
Records Record (computer science)
Parallel arrays Parallel array
Free list
Serialized Serialization
Dynamic memory allocators Dynamic memory allocation

Language support

Programming languages Programming language
Scheme Scheme (programming language)
Functional languages Functional programming language
Cons
Cdr Car and cdr

Internal and external storage

Machine code
Linear search
Index Index (database)
Hash table
Random-access list Random access list?action=edit&redlink=1
Skew binary random-access list Skew binary random access list?action=edit&redlink=1
Skew binary number system
Min-list Min-list?action=edit&redlink=1

Related data structures

Stacks Stack (data structure)
Queues Queue (data structure)
Skip list
Binary tree
Cache CPU cache
Heap Heap (data structure)
Self-organizing list

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Nodes128

Edges127

Triples235

Avg. degree1.98

Density0.015625

Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Linked list

Top relations

related to Further reading · 110

Linked list → ACM, ACM National Conference, Addison Wesley, Addison-Wesley, Algorithm Analysis, Algorithms, Allen, An Experiment, Angel, Annual Review, Antonakos, Archived, Automatic Programming, Bert, Bibcode, Big Java, Black, C/C, CayS, Ch20

related to history · 37

Linked list → ACM Turing Award, Allen Newell, Carnegie Mellon University, Cliff Shaw, COMIT, Europe, European, February, General Problem Solver, Herbert, Homeric, Information Processing, Information Processing Language, Information Theory, IPL, IRE Transactions, Latin, Linked, Logic Theory Machine, Massachusetts Institute

related to External links · 12

Linked list → Algorithms, Chapter, CImplementation, Data StructuresIntroduction, Description, Dictionary, Implementation, LibraryLinked List Problems, LibraryOpen Data Structures, Linked Lists, Pat MorinPatent, Stanford University Computer Science

related to Language support · 7

Linked list → ADTs, Although, In, Lisp, Many, Scheme, The

related to Doubly linked vs. singly linked · 6

Linked list → Double-linked, In, On, Some, To, XOR-linking

related to Circularly linked list · 5

Linked list → Circularly, Elements, For, In, The

related to Internal and external storage · 5

Linked list → Although, External, Internal, It, When

related to Linked lists using arrays of nodes · 5

Linked list → As, If, Languages, Not, The

related to Circularly linked vs. linearly linked · 4

Linked list → FIFO, In, Thus, With

related to Doubly linked list · 4

Linked list → However, In, The, XOR-linking

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

list linked node data lists nodes one array next structures may memory first used elements singly structure using two time

Entity relationships Subject–Predicate–Object triples

Subject	Predicate	Object	Confidence	Src
Linked list	is a	linear collection of data elements whose order is not given by their physical placement in memory	0.90	text
Linked list	is a	structure	0.90	text
Linked list	is a	linked list in which each node contains an array of data values	0.90	text
characters or Boolean values	instance of	which often makes them impractical for lists of small data items	0.80	text
because the storage overhead for the links may exceed by a factor of two or more the size of the data	instance of	which often makes them impractical for lists of small data items	0.80	text
Lisp	instance of	Language supportMany programming languages	0.80	text
Scheme have singly linked lists built in	instance of	Language supportMany programming languages	0.80	text
Linked list	related to Basic concepts and nomenclature	Each	0.60	section
Linked list	related to Basic concepts and nomenclature	The	0.60	section
Linked list	related to Circular linked list	In	0.60	section
Linked list	related to Circular linked list	It	0.60	section
Linked list	related to Circularly linked list	In	0.60	section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

Connections between topic areas Semantic bridges

Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

Min side: 3

Research this topic

Explore this topic

History

Tradeoffs

Overview

Linked list operations

Key facts & relationships

Topics to explore

Overview

History

Basic concepts and nomenclature

Tradeoffs

Linked list operations

Language support

Internal and external storage

Related data structures

Advanced semantic analysis

Map overview Semantic statistics

Linked list

How this topic connects Entity context

Linked list

Top relations

Important terminology Word statistics

Important terminology

Entity relationships Subject–Predicate–Object triples

Related concept clusters Concept neighborhoods

Connections between topic areas Semantic bridges