What is Data Structure ?

  • Data structures are used to store data in a computer in an organized form. In C language Different types of data structures are; Array, Stack, Queue, Linked List, Tree.

Array

  • An Array is a collection of similar data type value in a single variable.
  • An array is a derived data type in C, which is constructed from fundamental data type of C language.
 Array

Stack

  • Stack is linear data structure.
  • In stack addition of new data item and deletion of already existing data item is done from only one end, known as top.
  • Working of stack on the basis of Last-in-First-out (LIFO) principal, it means last entered item remove first.
 Stack

Queue

  • Queue is work on the principal of First-In-First-Out (FIFO), it means first entered item remove first.
  • Queue have two end front and back, from front you can insert element and from back you can delete element.
Queue

Linked List

  • Linked list is a special type of data structure where all data elements are linked to one another.
  • Linked list is the collection of nodes and every nodes contains two parts data part and address part.
Linked List

Tree

  • Stores data in a non linear form with one root node and sub nodes.
Tree

Categorized in:

Data Structure

Tagged in:

, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,

Share Article:

Leave a Reply

Ads Blocker Image Powered by Code Help Pro

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.

Powered By
Best Wordpress Adblock Detecting Plugin | CHP Adblock