Data Structures Tutorials

✅  DS Tutorials

Introduction to Data Structures 

Linear & Non-Linear Data Structures

Introduction to Algorithms

Performance Analysis

Space Complexity

Time Complexity

Asymptotic Notations

✅  Linked List

Linked List

Types of Linked List

Single Linked List

Circular Linked List

Double Linked List

✅  Arrays

Arrays

2D Array

Sparse Matrix

✅  Stack 

Stack

Array Implementation

Linked List Implementation 

Expressions

Infix to Postfix Conversion

Infix to Prefix Conversion

Postfix to Prefix Conversion

Postfix to Infix Conversion

Prefix to Postfix Conversion

Prefix to Infix Conversion

Postfix Evaluation 

✅  Queue 

Queue

Types of Queues

Queue using Array

Queue using Linked List

Circular Queue

Deque

 ✅  Tree

Tree

Tree Representations

Binary Tree

Binary Tree Properties

Binary Tree Representation

Binary Tree Traversals

Binary Search Tree

Binary Search Tree Operations

AVL Tree

AVL Tree Operations

B Tree

B + Tree

 ✅  Graphs

Introduction to Graphs

Graph Representations

Graph Traversal DFS

Graph Traversal BFS

Spanning Tree and Minimum Spanning Tree

Dijkstra's Algorithm

Kruskal's Algorithm

Prim's Algorithm

 ✅  Searching

Linear Search Algorithm

Binary Search Algorithm

✅  Sorting

Bubble Sort Algorithm

Insertion Sort Algorithm

Selection Sort Algorithm

Radix Sort

Quick Sort Algorithm

Merge Sort

Heap Sort Algorithm

1 comment:

  1. The correct place HostingSpell for easy learning is an environment that encourages curiosity, engagement, and support.



    ReplyDelete