Doubly linked list
A doubly linked list is a linked data structure whose nodes hold pointers to both the next and previous elements, allowing backward traversal and constant-time deletion.
Linked list
A linked list is a linear data structure whose nodes hold values and pointers to neighboring nodes, developed in 1955 by Newell, Shaw, and Simon.
Lookup table
A lookup table (LUT) is a precomputed array of values a program retrieves by index instead of computing them at run time, trading memory for speed.
Row- and column-major order
Row- and column-major order are the two ways of storing a multidimensional array in linear memory; C and NumPy use row-major, Fortran and MATLAB column-major.
Skip list
A skip list is a probabilistic data structure for sorted keys that supports search, insertion, and deletion in expected logarithmic time, introduced by William Pugh in 1990 and used in Redis and LevelDB.