data structure


In this video i have discussed basic introduction of data structures. Data structures are two types one is called the linear data structure and another is called the non- linear data structure. Linear data structures are: i. Arrays ii. Stack iii. Queue iv. Linked List Non- Linear data structures are: i. Trees ii. Graphs

Topics

1.1 Data Structures Introduction|Data Structure by Nargish Gupta [Hindi/English]
Play

1.11 Queue Data Structure| Introduction|Queue|Data Structure by Nargish Gupta [Hindi/English]
Play

1.12 Circular Queue|Data Structure|Queue by Nargish Gupta [Hindi/English]
Play

1.13 GATE Questions Based on Queue Data Structure|GATE by Nargish Gupta [Hindi/English]
Play

1.14 GATE Questions Based on Programming-1| In a Simple Way|GATE by Nargish Gupta [Hindi/English]
Play

1.15 GATE Questions Based on Programming-2| In a Simple Way by Nargish Gupta [Hindi/English]
Play

1.16 GATE Questions Based on Programming-3| In a Simple Way by Nargish Gupta [Hindi/English]
Play

1.17 Linked List| Introduction|Data Structure by Nargish Gupta [Hindi/English]
Play

1.18 Linked List| Traversing|Data Structure by Nargish Gupta [Hindi/English]
Play

1.19 Linked List| Algorithm for Inserting a Node at the End by Nargish Gupta [Hindi/English]
Play

1.2 Stack Data Structures|Push and Pop Algorithm|Data Structure by Nargish Gupta [Hindi English]
Play

1.20 Linked List| Algorithm for Inserting a Node at the Front by Nargish Gupta [Hindi/English]
Play

1.21 Linked List| Algorithm for Inserting a Node at the Specific Position by Nargish Gupta
Play

1.22 Linked List| Algorithm for Deleting a Node at the End by Nargish Gupta [Hindi/English]
Play

1.23 Linked List| Algorithm for Deleting a Node at the Front by Nargish Gupta [Hindi/English]
Play

1.24 Linked List| Algorithm for Deleting a Node at the Specific Position by Nargish Gupta
Play

1.25 Circular Linked List| Algorithm for Inserting a node at the End by Nargish Gupta
Play

1.26 Circular Linked List| Algorithm for Inserting a node at the Front by Nargish Gupta
Play

1.27 Circular Linked List| Algorithm for Inserting a node at the Specific Position by Nargish Gupta
Play

1.28 Circular Linked List| Algorithm for Deleting a node at the end by Nargish Gupta[Hindi/English]
Play

1.29 Circular Linked List| Algorithm for Deleting a Node at the Front by Nargish Gupta
Play

1.3 Stack Data Structures| Application|Data Structure by Nargish Gupta [Hindi/English]
Play

1.30 Circular Linked List| Algorithm for Deleting a Node at the Specific Position by Nargish Gupta
Play

1.31 Doubly Linked List|Introduction by Nargish Gupta [Hindi/English]
Play

1.32 Doubly Linked List| Algorithm for Inserting a Node at the End by Nargish Gupta[Hindi/English]
Play

1.33 Doubly Linked List| Algorithm for Inserting a Node at the Front by Nargish Gupta[Hindi/English]
Play

1.34 Doubly Linked List| Algorithm for Inserting a Node at the Specific Position by Nargish Gupta
Play

1.35 Doubly Linked List| Algorithm for Deleting a Node at the End by Nargish Gupta[Hindi/English]
Play

1.36 Doubly Linked List| Algorithm for Deleting a Node at the Front by Nargish Gupta[Hindi/English]
Play

1.37 Doubly Linked List| Algorithm for Deleting a Node at the Specific Position by Nargish Gupta
Play

1.4 Infix to Postfix Conversion|Stack|Data Structure by Nargish Gupta [Hindi/English]
Play

1.5 Infix to Prefix Conversion|Stack|Data Structure by Nargish Gupta [Hindi/English]
Play

1.6 Infix to Postfix Conversion Using Stack| Table Method|Stack by Nargish Gupta [Hindi/English]
Play

1.7 Evaluation of Postfix Expression Using Stack|Data Structure by Nargish Gupta [Hindi/English]
Play

1.8 GATE Question Based on Stack-1|GATE|Data Structure by Nargish Gupta [Hindi/English]
Play

1.9 GATE Question Based on Stack-2|Stack|GATE|Data Structure by Nargish Gupta [Hindi/English]
Play

2.1 Binary Tree Traversal|Tree Traversal|Tree|Data Structure by Nargish Gupta [Hindi/ English]
Play

2.2 Binary Tree Traversal Example-1|Tree| Tree Data Structure by Nargish gupta [Hindi/English]
Play

2.3 Binary Tree Traversal Example-2|Tree|Tree Data Structure by Nargish Gupta [Hindi/ English]
Play

2.4 Gate Question Based on Binary Tree Traversal-1| GATE by Nargish Gupta[Hindi/English]
Play

2.5 Gate Question Based on Binary Tree Traversal- 2|GATE by Nargish Gupta [Hindi/ English]
Play

2.6 Gate Question Based on Binary Search Tree Traversal-3| GATE by Nargish Gupta [Hindi/English]
Play

2.7 GATE 2020|Tree Traversal Previous Year Question |Inorder|Preorder|Postorder|Data Structures
Play

2-3 Tree in Data Structures | 3 order B Tree | 2-3 Tree Insertion
Play

3.1 Binary Search Tree Insertion|Binary Tree|Tree Data Structure by Nargish Gupta [Hindi/ English]
Play

3.2 Binary Search Tree Deletion|Binary Tree|Tree Data Structure by Nargish Gupta [Hindi/ English]
Play

3.2 Quick Sort Algorithm| Divide and Conquer| Quick Sort Algorithm Analysis by Nargish Gupta
Play

3.3 Gate Question Based on Binary Search Tree|GATE by Nargish Gupta [Hindi/English]
Play

3.3 Quick Sort|Example| Algorithm Design by Nargish Gupta[Hindi/English]
Play

3.4 Merge Sort Algorithm|Divide and Conquer|Merge Sort Algorithm Analysis by Nargish Gupta
Play

3.5 Merge Sort|Example|Algorithm Design by Nargish Gupta[Hindi/English
Play

4.1 AVL Tree Rotations- in a simple way|AVL Tree|Data Structures by Nargish Gupta [English/Hindi]
Play

4.2 AVL Tree Insertion|AVL Tree Example-1|Data Structure By Nargish Gupta [English/Hindi]
Play

4.3 AVL Tree|Insertion in AVL Tree|Example-2|Data Structure by Nargish Gupta
Play

4.4 AVL Tree Deletion|AVL Tree Deletion Example-1|Data Structure by Nargish Gupta [Hindi/English]
Play

4.5 AVL Tree Deletion|AVL Tree Deletion Example-2|Data Structure by Nargish Gupta [Hindi/English]
Play

4.6 AVL Tree|GATE Question Solution|Data Structure GATE Previous Year Questions by Nargish Gupta
Play

5.1 Red Black Tree Properties|Red Black Tree|Data Structure by Nargish Gupta[Hindi/ English]
Play

5.2 Red Black Tree Insertion Properties|Red Black Tree Insertion|Data Structure by Nargish Gupta
Play

5.3 Red Black Tree|Rotations|Red Black tree Insertion|Tree Data Structure by Nargish Gupta
Play

5.4 Red Black Tree|Insertion|Example|Tree Data Structure by Nargish Gupta [Hindi/English]
Play

5.5 Red Black Tree Insertion|Example-2|Tree Data Structure by Nargish Gupta [Hindi/English]
Play

5.6 Part-1|Red Black Tree|Deletion|Cases|Examples by Nargish Gupta[Hindi/English]
Play

5.7 Part-2|Red Black Tree|Deletion|Cases|Examples by Nargish Gupta[Hindi/English]
Play

5.8 Red Black Tree|Deletion|Examples-1 by Nargish Gupta[Hindi/English]
Play

5.9 Red Black Tree|Deletion|Examples-2 by Nargish Gupta[Hindi/English]
Play

6.1 B-TREES Basic Properties|Tree Data Structure by Nargish Gupta[Hindi/English]
Play

6.2 B-Tree Insertion|B Tree|Tree Data Structure by Nargish Gupta[Hindi/English]
Play

6.3 B-Tree Insertion Example|B Tree|Tree Data Structure by Nargish Gupta [Hindi/English]
Play

6.4 B-Tree Deletion|B Tree|Tree Data Structure by Nargish Gupta [Hindi/
Play

6.5 B+ Tree Basics|B Tree|Tree Data Structure by Nargish Gupta [Hindi/English]
Play

6.6 B+ Tree Construction|B+ Tree|Tree Data Structure by Nargish Gupta [Hindi/English]
Play

6.7 Gate Questions Based on B+ Tree|GATE by Nargish Gupta [Hindi/English]
Play

6.8 Gate Questions-2 Based on B+ Tree|GATE by Nargish Gupta [English Hindi]
Play

6.9 Comparison Between Binary Tree, BST, AVL,Red -Black, B, B+ Tree|Tree Data Structure
Play

6.9 Comparison Between Binary Tree, BST, AVL,Red -Black, B, B+ Tree|Tree Data Structure
Play

7.1 Heap Tree Basics|Heap Tree|Heap Data Structure by Nargish Gupta[Hindi/English]
Play

7.2 Heap Sort| Min Heap Insertion by Nargish Gupta[Hindi/English]
Play

7.3 Heap Sort|Max Heap Insertion by Nargish Gupta[Hindi/English]
Play

7.4 Heap Sort| Min Heap Deletion by Nargish Gupta [Hindi/English]
Play

7.5 Heap Sort| Max Heap Deletion by Nargish Gupta[Hindi/Eglish]
Play

7.6 Gate Questions Based on Heap Sort Algorithm by Nargish Gupta[Hindi/English]
Play

7.7 Gate Question-2 Based on Heap Sort Algorithm by Nargish Gupta[Hindi/English]
Play

8.1 Binary Search|Binary Search Algorithm|Searching Algorithm|Data Structure by Nargish Gupta
Play

8.2 Introduction to Sorting Algorithms|Sorting|Parameters of Sorting|Sorting in Data Structures
Play

8.3 Bubble Sort|Bubble Sort Algorithm and Analysis|Data Structure by Nargish Gupta[Hindi/English]
Play

8.4 Bubble Sort|Bubble Sort Example|Bubble Sort Algorithm with Example|Data Structure by Nargish
Play

8.5 Insertion Sort|Insertion Sort Algorithm and Analysis|Data Structures by Nargish Gupta
Play

8.6 Insertion Sort|Insertion Sort Example|Data Structures by Nargish Gupta
Play

8.7 Selection Sort|Selection Sort Algorithm and Analysis|Data Structure by Nargish Gupta
Play

8.8 Selection Sort|Selection Sort Example|Data Structure by Nargish Gupta
Play

BFS & DFS Graph Traversals Algorithms Breadth-First Search & Depth First Search Example
Play

GATE 2015 (SET-1)|CS|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2015 (SET-2)|CS|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2015 (SET-3)|CS|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2015 (SET-3)|CS|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2017|Computer Science|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2018|Computer Science|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

GATE 2020|Computer Science|Complete Paper Solution|Data Structures and Algorithm by Nargish Gupta
Play

Hashing | Separate Chaining | Collision Resolving Techniques
Play

Linear Probing in Hashing | Collision Resolving Techniques | Hashing | Example
Play

Linked List Deletion Program in C | Program to Delete a node at a Specified Position
Play

Linked List Deletion Program in C | Program to Delete a node at the End and Beginning
Play

Linked List Insertion Program C | Linked List Program to Insert a Node at a Specific Position
Play

Linked List Project in C | Mini Project on Linked List | C Programming
Play

Mini Project | Data Structures Mini Project | All in One Data Structures using C | C Project
Play

Minimum Cost Spanning Tree | Krushkal's Algorithm Example | Greedy Technique | MST
Play

Prim's Algorithm | Minimum Cost Spanning Tree | Prim's Algorithm Example | Greedy Technique | MST
Play

Program to Create a Singly Linked List | Linked List Implementation using C | PART 1
Play

UGC-NET|AUG 2016|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|DEC 2018|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|DEC 2019|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|JAN 2017|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|JULY 2016|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|JULY 2018|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|JUN 2015|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|JUN 2019|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

UGC-NET|NOV 2017|Computer Science|Solved Paper|Data Structures and Algorithm by Nargish Gupta
Play

Subscribe Now