# Are you new to Data Structures and Algorithms (DSA)?

Let’s get to know about all of those we would be learning.

Data Structure is a way to store and organize data so that it can be used efficiently. Our Data Structure tutorial includes all topics of Data Structure such as Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching, Sorting, Programs, etc. ### 1.Array

• Data Structures
1. One-Dimensional Array
2. Multi-Dimensional Array
• Algorithms
1. Traverse
2. Insert
3. Delete
4. Get
5. Search
6. Size
7. Reverse

• Data Structures
• Algorithms
1. Traverse
3. InsertAtEnd
4. Insert
6. DeleteAtEnd
7. Delete
8. Update
9. Get
10. Search
11. IsEmpty
12. Reverse

### 3.Stack

• Data Structures
1. Stack
• Algorithms
1. Push
2. Pop
3. IsEmpty
4. Top

### 4.Queues

• Data Structures
1. Queue
2. Circular Queue
3. Priority Queue
4. Dequeue
• Algorithms
1. Enqueue
2. Dequeue
3. IsEmpty
4. Top

### 5.Hash Table

• Data Structures
1. Hash Table
• Algorithms
1. Hashing/Hash Function (Division Method, Multiplication Method)
2. Hash Collision (Collision Resolution, Open Addressing like Linear Probing, Quadratic Probing, Double Hashing)

### 6.1Heap

• Data Structures
1. Binary Tree
2. Binary Search Tree
3. AVL Tree
4. B-Tree
5. B+ Tree
6. Red Black Tree
7. Trie
• Algorithms
1. Traversal
2. Height of a Node/Tree
3. Depth of a Node
4. Degree of a Node
5. Insert
6. Delete
7. Get
8. Search

### 6.2Heap

• Data Structures
1. Heap
2. Fibonacci Heap
• Algorithms
1. Heapify
2. Insert
3. Delete
4. Peek (Max/Min Element)
5. Extract (Max/Min Element)

### 7.Graph

• Data Structures
1. Graph (Directed, Undirected)
• Algorithms
1. Graph Traversal
2.  Depth First Search
5.  Delete Element
6. Find the path between 2 elements

### 8.Sorting Algorithms

1. Bubble Sort
2. Selection Sort
3.  Insertion Sort
4.  Merge Sort
5.  Quick Sort
6.  Counting Sort
8.  Bucket Sort
9.  Heap Sort
10. Shell Sort

### 9.Search Algorithms

1. Linear Search
2.  Binary Search

### 10.Other Algorithms

1. Divide and Conquer Algorithms
2. Greedy Algorithms
3.  Dynamic Programming