<P> There are numerous types of data structures, generally built upon simpler primitive data types: </P> <Ul> <Li> An array is a number of elements in a specific order, typically all of the same type . Elements are accessed using an integer index to specify which element is required (Depending on the language, individual elements may either all be forced to be the same type, or may be of almost any type). Typical implementations allocate contiguous memory words for the elements of arrays (but this is not always a necessity). Arrays may be fixed - length or resizable . </Li> <Li> A linked list (also just called list) is a linear collection of data elements of any type, called nodes, where each node has itself a value, and points to the next node in the linked list . The principal advantage of a linked list over an array, is that values can always be efficiently inserted and removed without relocating the rest of the list . Certain other operations, such as random access to a certain element, are however slower on lists than on arrays . </Li> <Li> A record (also called tuple or struct) is an aggregate data structure . A record is a value that contains other values, typically in fixed number and sequence and typically indexed by names . The elements of records are usually called fields or members . </Li> <Li> A union is a data structure that specifies which of a number of permitted primitive types may be stored in its instances, e.g. float or long integer . Contrast with a record, which could be defined to contain a float and an integer; whereas in a union, there is only one value at a time . Enough space is allocated to contain the widest member datatype . </Li> <Li> A tagged union (also called variant, variant record, discriminated union, or disjoint union) contains an additional field indicating its current type, for enhanced type safety . </Li> <Li> A class is a data structure that contains data fields, like a record, as well as various methods which operate on the contents of the record . In the context of object - oriented programming, records are known as plain old data structures to distinguish them from classes . </Li> </Ul> <Li> An array is a number of elements in a specific order, typically all of the same type . Elements are accessed using an integer index to specify which element is required (Depending on the language, individual elements may either all be forced to be the same type, or may be of almost any type). Typical implementations allocate contiguous memory words for the elements of arrays (but this is not always a necessity). Arrays may be fixed - length or resizable . </Li> <Li> A linked list (also just called list) is a linear collection of data elements of any type, called nodes, where each node has itself a value, and points to the next node in the linked list . The principal advantage of a linked list over an array, is that values can always be efficiently inserted and removed without relocating the rest of the list . Certain other operations, such as random access to a certain element, are however slower on lists than on arrays . </Li>

What do you mean by data structure in hindi