数组 (Array)
中文介绍：数组是一种线性数据结构，它由一系列相同类型的元素组成，这些元素在内存中连续存储。通过使用索引，可以快速访问和修改数组中的元素。
英文介绍：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)
中文介绍：链表是一种线性数据结构，它由一系列节点组成，每个节点包含数据和一个指向下一个节点的指针。链表的元素在内存中可以不连续存储，通过指针将它们连接在一起。
英文介绍：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.
栈 (Stack)
中文介绍：栈是一种具有特定操作的线性数据结构，它遵循"先进后出"（LIFO）的原则。只能在栈顶进行插入和删除操作，即最后插入的元素最先被删除。
英文介绍：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.
队列 (Queue)
中文介绍：队列是一种具有特定操作的线性数据结构，它遵循"先进先出"（FIFO）的原则。只能在队尾进行插入操作，在队头进行删除操作，即最先插入的元素最先被删除。
英文介绍：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.
散列表 (Hash Table)
中文介绍：散列表是一种通过散列函数将键映射到存储位置的数据结构。它支持常数时间复杂度的插入、删除和查找操作，提供了高效的数据存储和检索。
英文介绍：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.
树 (Tree)
中文介绍：树是一种非线性数据结构，它由一组节点组成，节点之间通过边连接。树的顶部称为根节点，每个节点可以有零个或多个子节点，形成层次结构。
英文介绍：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.
图 (Graph)
中文介绍：图是一种非线性数据结构，它由节点（顶点）和连接节点的边组成。图可以用来表示各种实际问题，通过节点和边之间的关系来描述对象之间的关联性。
英文介绍：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.
位图 (Bitmap)
中文介绍：位图是一种用位来表示数据的数据结构。每个位都可以表示一个布尔值（0或1），因此位图常用于高效地存储和操作大量的布尔数据。
英文介绍：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.
布隆过滤器 (Bloom Filter)
中文介绍：布隆过滤器是一种概率型数据结构，用于快速检测一个元素是否属于一个集合。它通过使用多个哈希函数和位数组来实现，可以高效地判断元素的存在性，但有一定的误判率。
英文介绍：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.