What is Data Structure? Fundamentals of Data Structure

Data Structure

Data Structure is a method of organizing data in computers to reduce complexity and to use it effectively.

Data Structure is a branch of Computer Science to Knowledge of the data Should be organized, how the flow of data should be controlled and how a data structures should be designed and implemented to reduce the complexity and increase the efficiency of the algorithm.

The theory of structure not only introduces to the Data Structures but also helps you to understand and use the concept of abstraction analysis problem Sep by step and develop an algorithm to solve the real-world problem.

The data structures help you to understand the relationship of the data elements with the order.

Examples:

Stack, Queue, LinkedList, Array, Graph, Tree.

What is ADT(Abstract Data Types)?

In computer science, an abstract data type (ADT) is a mathematical model for data types, where a data type is defined by its behavior from the point of view of the user of the data

Overview:

Array: Array is a collection of similar data types.

Stack: Stack is LIFO (Last in First Out) data structure where the element that added last will deleted first.

Queue: Queue is FIFO (First In First Out) data structure where the element that added first will delete first.

LinkedList: A linked list is a collection of nodes.

Tree: Tree is a collection of elements or nodes.

Graph: Graph is a collection of vertices and edges.