Data Structure
A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.
Classification of Data Structure
These are the predefined way of storing data in the system. All sets of operations are pre-defined. Char, int, float, double are examples of primitive data structures.
Non-Primitive Data Structures
The data structures which are designed using primitive data structures are called non-primitive data structures. They are used to store a collection of data. It can be categorized into two parts:
- Data Structures
- Primitive
- int
- char
- float
- double
- Non Primitive
- Linear
- Array
- Linked List
- Stack
- Queue
- Non Linear
- Tree
- Graph
L I N E A R
N O N L I N E A R [ T R E E B A S E D ]
N O N L I N E A R [ G R A P H B A S E D ]
- Array
- Linked list [ Singly | Doubly | Circular ]
- Stack
- Queue [ Simple | Circular | Priority | Double Ended ]
- Dequeue
- Hash Table
- Heap
- Fibonacci Heap
N O N L I N E A R [ T R E E B A S E D ]
- Tree [ Inorder | Preorder | Levelorder | Postorder ]
- Binary Tree [ Full | Perfect | Complete | Balanced ]
- Binary Search Tree [ BST ]
- AVL Tree
- B- Tree
- B+ Tree
- Red-Black Tree
N O N L I N E A R [ G R A P H B A S E D ]
- Graph Data Structure
- Spanning Tree and Minimum Spanning Tree
- Strongly Connected Components
- Adjacency Matrix
- Adjacency List
- Breath First Search [ BFS ]
- Depth First Search [ DFS ]
Comments
Post a Comment