Question

what is data structure ​

Answer 1

Answer:

Data Structure can be defined as the group of data elements which provides an efficient way of storing and organising data in the computer so that it can be used efficiently. there are generally four forms: ... Linear: arrays, lists. Tree: binary, heaps, space partitioning etc.

Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc.

Answer 2

գυєѕτíօи :

❥ What is data structure ?

αиѕաєя :

➛ In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

мοяє íиfο :

➛ Data structures, there are generally four forms :

⤍ Linear : Arrays, lists

• Array :

⤍ An array is a finite group of data, which is allocated contiguous memory locations, and each element within the array is accessed via an index key .

• Linked List :

⤍ A linked list is different to an array in that the order of the elements within the list are not determined by a contiguous memory allocation.

⤍ Tree : Binary , heaps , space partitioning .

• Tree :

⤍ The concept of a ‘tree’ in its simplest terms is to represent a hierarchical tree structure, with a root value and subtrees of children , represented as a set of linked nodes.

• Binary Search Tree :

⤍ A binary search tree is a ‘sorted’ tree, and is named as such because it helps to support the use of a ‘binary search’ algorithm for searching more efficiently for a particular node .

⤍ Hash : distributed hash table, hash tree .

⤍ Graphs : decision, directed, acyclic .

❥ ꪀíցнτмαяє ࿐