7:28
Definition of data structure|what is data structure
Sudhakar Atchala
5:15
Types of data structure
4:27
abstract data type|ADT
6:30
List ADT|list adt using array
4:25
Array Operations
13:54
C Program to insert an element into the array at begin position
13:05
C Program to insert an element into the array at specified position
6:03
C Program to insert an element into the array at end position
9:40
C Program to delete an element from the array at begin position
8:58
C Program to delete an element from the array at specified position
6:20
C Program to delete an element from the array at end position
6:55
C Program to update an array element at specified position
7:41
Limitations of arrays in C or Limitations of Static memory allocation
8:13
performance analysis of an algorithm | Data Structures | Design and analysis of Algorithms || DAA
15:19
frequency count method to calculate Time Complexity of an Algorithm|step count method | DS | DAA
19:40
asymptotic notations in data structure with example || Design and analysis of Algorithms || DAA
6:53
Types of computing times || data structures || Design and analysis of Algorithms || DAA
10:27
General rules or norms for calculating time complexity || Data Structures || DAA
9:45
Space Complexity of an Algorithm in Data Structures || Design and analysis of Algorithms || DAA
36:47
LINKED LIST (CREATION AND DISPLAY) - DATA STRUCTURES
24:46
LINKED LIST (INSERTION AT BEGINNING,ENDING,SPECIFIED POSITION ) - DATA STRUCTURES
14:01
LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES
5:53
counting number of nodes in a single linked list
10:06
searching a node in singly linked list
14:02
sorting a singly linked list
14:36
reversing a singly linked list in c
9:09
advantages and disadvantages of linked list|differences between array and linked list
21:15
CIRCULAR LINKED LIST (CREATE AND DISPLAY) - DATA STRUCTURES
18:10
CIRCULAR LINKED LIST (INSERTION AT BEGINNING,ENDING,SPECIFIED POSITION ) - DATA STRUCTURES
19:53
CIRCULAR LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES
4:26
advantages and disadvantages of circular linked list
22:22
DOUBLE LINKED LIST (CREATE AND DISPLAY) - DATA STRUCTURES
18:34
DOUBLE LINKED LIST (INSERTION AT BEGINNING,ENDING,SPECIFIED POSITION ) - DATA STRUCTURES
10:11
DOUBLE LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES
10:44
Reversing Double Linked List
6:17
advantages and disadvantages of doubly linked list
23:23
Circular Double Linked List Create and Display
26:31
Circular Double Linked List Insertion (Begin, end and Specified Position)
22:42
Circular Double Linked List Deletion ( Begin, end and Specified Position )
5:10
Applications of Linked List data structure
29:36
polynomial adt|polynomial addition in data structure
26:55
stacks using arrays
19:23
Stacks using linked list
5:41
arithmetic expression in data structure|applications of stacks
23:56
postfix expression evaluation algorithm|example|program
40:49
infix to postfix conversion algorithm|examples|program
20:47
balancing symbols using stack algorithm|example|program|delimiter matching using stack
25:06
queues using arrays
15:35
Queues using linked list
29:53
circular queues in data structures
21:00
double ended queue using array
27:45
double ended queue using linked list
25:42
Linear Search
36:26
Binary Search
6:43
bubble sort with example
35:50
Bubble Sort algorithm|bubble sort program|bubble sort example
8:42
selection sort with example
28:46
Selection Sort algorithm|selection sort example|selection sort program
5:21
insertion sort with example
41:48
Insertion Sort algorithm|insertion sort program|insertion sort example
32:06
merge sort algorithm|merge sort algorithm with example|merge sort program
11:37
MERGE SORT WITH EXAMPLE
6:24
analysis of merge sort|merge sort time complexity analysis
34:14
quicksort algorithm|quicksort program|quicksort example step by step
10:21
quicksort example step by step|quick sort example solved
8:57
analysis of quicksort algorithm|quicksort time complexity analysis
radix sort algorithm|bucket sort algorithm||program|example step by step
17:16
radix sort example step by step|bucket sort example step by step
16:54
shell sort example step by step|shell sort example in data structure
18:43
shell sort algorithm|shell sort program in c|shell sort with example
13:00
tree terminology in data structure
10:34
what is binary tree|types of binary tree
12:32
representation of binary tree
10:01
binary tree traversals
27:54
C program to implement Binary Tree Traversals || Data Structures
construct binary tree from inorder and preorder traversal examples
7:12
construct binary tree from inorder and postorder traversal examples
20:04
heap sort algorithm with example|heap sort example step by step
22:03
Heap Sort Program explanation with an example
7:19
construction of expression tree using postfix expression- Data Structures
5:38
what is binary search tree|list of binary search tree operations
5:25
construction of binary search tree with example|binary search tree example step by step
14:50
insertion of a node in binary search tree|binary search tree insertion
19:43
deletion of a node in binary search tree|binary search tree node deletion
10:00
searching a node in binary search tree|binary search tree search operation
6:00
find smallest element in binary search tree|Find min element in a binary search tree
7:02
find largest node in binary search tree
21:29
what is an avl tree|avl tree rotations
10:52
Construct AVL tree for the elements 1,2,3,4,5,6,7,8|AVL Tree Insertion with example
21:54
construct AVL tree for 20,11,5,32,40,2,4,27,23,28,50 |avl tree insertion with example
23:44
Construct AVL Tree for 7,14,2,5,10,33,56,30,15,25,66,70,4|AVL Tree insertion with example
14:26
graph terminology in data structure
10:18
representation of graph in data structure
12:14
Graph Traversals - Breadth First Search|BFS
12:42
Graph traversal - Depth first search|DFS
5:51
what is minimum cost spanning tree
Prim's Algorithm for Minimum Cost Spanning Tree
8:54
Kruskal’s Algorithm for Minimum Cost Spanning Tree
16:15
Hashing|Hash Table|Hash Function|Types of hash functions|Characteristics of a good hash function
20:08
collision resolution techniques|Separate Chaining|open addressing|linear probing|Quadratic|Double
5:08:20
Sorting Techniques || Algorithm || Program || Example Tracing || Analysis || Time Complexity
8:54:42
Algorithm Analysis || Linked List ( Single, Circular, Double, Circular Double) || Operations || DS
4:16:45
Stacks and Queues Tutorial
6:08:47
Trees, Graphs and Hashing in Data Structures
10:07
Rehashing in Data Structures || Collision Resolution Technique