Lesson 6 of 14 • 1 upvotes • 9:47mins
In this video we will study about the polish notations and learn how to convert the infix expression into postfix expression.
14 lessons • 2h 14m
Introduction to Data Structures (in Hindi)
15:00mins
Algorithm and their Complexity (in Hindi)
9:50mins
Arrays: Part 1 (in Hindi)
11:23mins
Array: Part 2 (in Hindi)
10:06mins
Stacks: Part 1 (in Hindi)
7:33mins
Arithmetic expression; Polish notation.
9:47mins
Example of notation conversion.
7:48mins
Tower of Hanoi
11:14mins
In this lecture we will study about the queues and their representation.
7:23mins
In this we will study the algorithm for insertion and deletion in queues.
7:13mins
Deques
6:44mins
Priority queues.
10:24mins
Introduction to Linked list.
10:47mins
Traversing in a linked list.
8:59mins