Data Structure Terminology in CS

Chinese Description: An array is a linear data structure consisting of a collection of elements of the same type, stored contiguously in memory. Elements in an array can be accessed and modified quickly using indices.
English Description: An array is a linear data structure consisting of a collection of elements of the same type, stored contiguously in memory. Elements in an array can be accessed and modified quickly using indices.

Linked List

Chinese Description: A linked list is a linear data structure composed of a series of nodes, each containing data and a pointer to the next node. Unlike an array, the elements in a linked list can be stored non-contiguously in memory and are connected together using pointers.
English Description: A linked list is a linear data structure composed of a series of nodes, each containing data and a pointer to the next node. Unlike an array, the elements in a linked list can be stored non-contiguously in memory and are connected together using pointers.

Chinese Description: A stack is a linear data structure with specific operations that follows the Last-In-First-Out (LIFO) principle. Insertion and deletion can only be performed at the top of the stack, meaning the last element inserted is the first one to be removed.
English Description: A stack is a linear data structure with specific operations that follows the Last-In-First-Out (LIFO) principle. Insertion and deletion can only be performed at the top of the stack, meaning the last element inserted is the first one to be removed.

Chinese Description: A queue is a linear data structure with specific operations that follows the First-In-First-Out (FIFO) principle. Insertion can only be performed at the rear of the queue, and deletion can only be performed at the front, meaning the first element inserted is the first one to be removed.
English Description: A queue is a linear data structure with specific operations that follows the First-In-First-Out (FIFO) principle. Insertion can only be performed at the rear of the queue, and deletion can only be performed at the front, meaning the first element inserted is the first one to be removed.

Chinese Description: A hash table is a data structure that maps keys to storage locations using a hash function. It supports constant-time complexity for insertion, deletion, and lookup operations, providing efficient data storage and retrieval.
English Description: A hash table is a data structure that maps keys to storage locations using a hash function. It supports constant-time complexity for insertion, deletion, and lookup operations, providing efficient data storage and retrieval.

Chinese Description: A tree is a non-linear data structure composed of a collection of nodes connected by edges. The topmost node is called the root, and each node can have zero or more child nodes, forming a hierarchical structure.
English Description: A tree is a non-linear data structure composed of a collection of nodes connected by edges. The topmost node is called the root, and each node can have zero or more child nodes, forming a hierarchical structure.

Chinese Description: A graph is a non-linear data structure composed of nodes (vertices) and edges that connect the nodes. Graphs can be used to represent various real-world problems and describe the relationships between objects through the connections between nodes and edges.
English Description: A graph is a non-linear data structure composed of nodes (vertices) and edges that connect the nodes. Graphs can be used to represent various real-world problems and describe the relationships between objects through the connections between nodes and edges.

Chinese Description: A bitmap is a data structure that represents data using bits. Each bit can represent a boolean value (0 or 1), so bitmaps are commonly used for efficient storage and manipulation of large amounts of boolean data.
English Description: A bitmap is a data structure that represents data using bits. Each bit can represent a boolean value (0 or 1), so bitmaps are commonly used for efficient storage and manipulation of large amounts of boolean data.

Chinese Description: A Bloom filter is a probabilistic data structure used to quickly check if an element belongs to a set. It is implemented using multiple hash functions and a bit array, allowing efficient determination of element existence, but with a certain false positive rate.
English Description: A Bloom filter is a probabilistic data structure used to quickly check if an element belongs to a set. It is implemented using multiple hash functions and a bit array, allowing efficient determination of element existence, but with a certain false positive rate.