Data Structure in C

Data Structure in C

Data structures are used to store data in a computer in an organized form. In C Programming Language Different types of data structures are; Array, Stack, Queue, Linked List, Tree. In term of computer programming language, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms

Data Structure in C Programming Language is a specialized format for organizing and storing data. In General data structure types include the file, array, record, table, tree.. etc.

• Array: Array is collection of similar data type, you can insert and deleted element form array without follow any order.
• Stack: Stack work on the basis of Last-In-First-Out (LIFO). Last entered element removed first.
• Queue: Queue work on the basis of First-In-First-Out (FIFO). First entered element removed first.
• Linked List: Linked list is the collection of node, Here you can insert and delete data in any order.
• Tree: Stores data in a non linear form with one root node and sub nodes.

Algorithm

An algorithm is a finite set instruction, which is written for solve any problem. Algorithm is not the complete code or program, it is just like a English language.