It is an educational channel contains technical videos for B.TECH CSE/IT ,MCA,BSC COMPUTER SCIENCE, engineering students and useful for competitive examinations like GATE,UGC NET,CSIR NET,PGECET.

Construct AVL Tree for the Days of a Week || AVL Tree for the Strings || AVL Tree Insertion || DS
26:30
Construct AVL Tree for the Days of a Week || AVL Tree for the Strings || AVL Tree Insertion || DS
Construct AVL tree for the elements 1,2,3,4,5,6,7,8,9,10 || AVL Tree for 1 to 10 numbers || ADS ||
50:19
Construct AVL tree for the elements 1,2,3,4,5,6,7,8,9,10 || AVL Tree for 1 to 10 numbers || ADS ||
AVL Tree for the Strings || AVL Tree Insertion || Construct AVL Tree for the Strings || DS || ADS
30:07
AVL Tree for the Strings || AVL Tree Insertion || Construct AVL Tree for the Strings || DS || ADS
AVL Tree for the Months || AVL Tree Insertion || Construct AVL Tree for the Months || DS || ADS
41:32
AVL Tree for the Months || AVL Tree Insertion || Construct AVL Tree for the Months || DS || ADS
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
1:12:43
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
1:10:41
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
58:53
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
32:37
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
Queue Operations in Data Structure || Queue in Data Structure || Queue using Arrays || Queue || ADS
40:42
Queue Operations in Data Structure || Queue in Data Structure || Queue using Arrays || Queue || ADS
Queue in Data Structure || Introduction to Queue in Data Structures || Queue using Arrays || DS
33:59
Queue in Data Structure || Introduction to Queue in Data Structures || Queue using Arrays || DS
AVL Tree Deletion || AVL Tree Deletion with Example || AVL Tree Deletion Example || AVL Tree || DS
34:27
AVL Tree Deletion || AVL Tree Deletion with Example || AVL Tree Deletion Example || AVL Tree || DS
AVL Tree Insertion || Construct AVL Tree for the Elements 7,14,2,5,10,33,56,30,15,25,66,70,4 || DS
59:07
AVL Tree Insertion || Construct AVL Tree for the Elements 7,14,2,5,10,33,56,30,15,25,66,70,4 || DS
Queue using Arrays || Implementation of Queue using Arrays || Queue using Array || Queue || DS
23:19
Queue using Arrays || Implementation of Queue using Arrays || Queue using Array || Queue || DS
Stack in Data Structure || Introduction to Stack || Stack Operations || What is Stack || DS || ADS
44:32
Stack in Data Structure || Introduction to Stack || Stack Operations || What is Stack || DS || ADS
Stack using Array || Implementation of Stack using Array || Stack using Arrays || DS || ADS
27:24
Stack using Array || Implementation of Stack using Array || Stack using Arrays || DS || ADS
Space Complexity || Calculating Space Complexity || Algorithm Analysis || Space Complexity Example
18:23
Space Complexity || Calculating Space Complexity || Algorithm Analysis || Space Complexity Example
Time Complexity || Frequency Count Method || Calculating Time Complexity || Algorithm Analysis ||
31:40
Time Complexity || Frequency Count Method || Calculating Time Complexity || Algorithm Analysis ||
Time Complexity || Algorithm Analysis || Frequency Count Method Calculating Time Complexity || ADS
22:01
Time Complexity || Algorithm Analysis || Frequency Count Method Calculating Time Complexity || ADS
Algorithm Analysis || Priori Analysis || Posteriori Analysis || Priori Vs Posteriori Analysis | ADS
13:14
Algorithm Analysis || Priori Analysis || Posteriori Analysis || Priori Vs Posteriori Analysis | ADS
Algorithm || Characteristics of an Algorithm || Properties of an Algorithm || Advantages || DS | ADS
16:01
Algorithm || Characteristics of an Algorithm || Properties of an Algorithm || Advantages || DS | ADS
Reversing String using Stack || Reversing List using Stack || Applications of Stack || DS
24:03
Reversing String using Stack || Reversing List using Stack || Applications of Stack || DS
Expressions in Data Structures || Infix Expression || Postfix Expression || Prefix Expression || DS
8:30
Expressions in Data Structures || Infix Expression || Postfix Expression || Prefix Expression || DS
(Program) Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack
24:47
(Program) Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack
Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack || DS
20:50
Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack || DS
(Program) Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm
32:32
(Program) Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm
Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm || DS
22:17
Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm || DS
A good idea that will benefit the poor people in society ||
5:40
A good idea that will benefit the poor people in society ||
Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm || DS
27:03
Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm || DS
(Program) Infix to Postfix using Stack || Infix to Postfix Conversion || Infix to Postfix Algorithm
24:32
(Program) Infix to Postfix using Stack || Infix to Postfix Conversion || Infix to Postfix Algorithm
Infix to Postfix using Stack || Infix to Postfix Conversion || Infix to Postfix Algorithm || DS
15:52
Infix to Postfix using Stack || Infix to Postfix Conversion || Infix to Postfix Algorithm || DS