Define Data Structure and it's types?



What is Data Structure. Define it?

The term Data means Values and Structure means the way it is organized and arranged into mathematical and logical way. So the mathematical and logical model of a particular organisation of data is known as Data Structures. 
It is specialized format for organizing and storing data. It is also a particular way to store and organize data in a computer so that we can efficiently use it. We use data structures almost every program and software system. It provides us data efficiency such as large databases. 
A data structure may be designed to store data for working on it with various algorithms. 
Some common data structures are:-

  • Array
  • Linked List
  • Stack
  • Queue
  • Heap
  • Hash-Table
  • Tree:- Binary Tree
  • Red-Black Tree
  • B Tree

Types Of Data Structure:-

There are two types of Data Structures as given below:-
  • Linear Data Structures
  • Non Linear Data Structures

Linear Data Structure:-

The Data structure is said to be Linear Data Structures if it's elements are in a sequence and form a linear series.
For Example:- Array, Queue, linked list and Stacks.

Non-Linear Data Structure:-

The Data structure is said to be Non-Linear Data Structures if it's elements do not form a sequence or a linear series but form a hierarchical format.
For Example:- Graph, Tree, Binary Search Tree etc.

No comments:

Post a Comment