Please Login To Continue
Primitive Operations of Stack-(PUSH and POP): Part 1 (in Hindi)
Lesson 2 of 10 • 0 upvotes • 8:05mins
Megha Tamrakar
Push algorithm and explanation with diagram , pop algorithm and explanation with diagram. Condition of overflow and under flow
(Hindi) (NCERT) Data Structure- Part II (for Class 12th)
10 lessons • 1h 34m
1
Stack Data Structure: Part 1 (in Hindi)
8:07mins
2
Primitive Operations of Stack-(PUSH and POP): Part 1 (in Hindi)
8:05mins
3
Evaluation of Postfix Expression using Stack: Part 1 (in Hindi)
10:15mins
4
Evaluation of Postfix Expressions using Stack: Part 2 (in Hindi)
9:58mins
5
Algorithm of conversion from Infix to Postfix Expression:: Part 1 (in Hindi)
10:17mins
6
Example of Conversion From Infix to postfix Expressions
12:55mins
7
Queue: Linear queue(class 12th Data structure)
8:13mins
8
Linear Queue operations(class 12th)
9:50mins
9
Circular queue(for class 12th)
8:07mins
10
Link list for (class 12th)
9:01mins
Crack CBSE Class 12 with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
