Please Login To Continue
Evaluation of postfix Expression using stack(part- 2)
Lesson 11 of 22 • 1 upvotes • 9:28mins
Megha Tamrakar
Evaluation of postfix expression using stack: Its algorithm and example.
(NCERT) Data Structure (Class 12th)
22 lessons • 3h 12m
1
Data structure Overview
8:02mins
2
Array Data Structure
8:20mins
3
Insertion In Arrays
9:32mins
4
Deletion In Arrays
8:02mins
5
Linear Search
8:02mins
6
2- Dimensional Arrays(part-1)
8:40mins
7
2-Dimensional Arrays(part-2)
8:32mins
8
Stack Data Structures
8:13mins
9
Primitive Operations of Stack(push and pop)
8:10mins
10
Evaluation of postfix Expression
9:15mins
11
Evaluation of postfix Expression using stack(part- 2)
9:28mins
12
Infix to Postfix Conversion
9:58mins
13
Linear Queue
8:10mins
14
Linear queue Operations
8:16mins
15
Circular Queue
8:15mins
16
Link List
8:44mins
17
Binary Search part -1
10:24mins
18
Binary Search part- 2
8:50mins
19
Bubble sort(part -1)
10:09mins
20
Bubble Sort(part-2)
9:03mins
21
Selection Sort
8:17mins
22
Insertion Sort
8:21mins
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
