Lesson 5 of 10 • 7 upvotes • 6:44mins
Polish Notation and evaluation of postfix notation
10 lessons • 40m
Queues (in Hindi)
2:50mins
Stacks (in Hindi)
3:36mins
In-Order Traversal of Binary Tree (in Hindi)
2:56mins
Post-Order Traversal of Binary Tree (in Hindi)
2:37mins
Polish Notation (in Hindi)
6:44mins
Breadth First Search (in Hindi)
5:54mins
Depth First Search (in Hindi)
4:20mins
Prim's Algorithm (in Hindi)
2:21mins
Kruskal's Algorithm (in Hindi)
3:11mins
Greedy Algorithm - Job Sequencing (in Hindi)
5:40mins