Data Structure in C

Data Structure in C

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: Array is a collection of similar data type, you can insert and delete an element from the array without following 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 a 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 to solve any problem. An algorithm is not the complete code or program, it is just like the English language.

SHARES

Share

Pin it

Tweet

Share

Share

Share

Buffer

Print

About Mariano

I'm Ethan Mariano a software engineer by profession and reader/writter by passion.I have good understanding and knowledge of AngularJS, Database, javascript, web development, digital marketing and exploring other technologies related to Software development.