Please Login To Continue
Tower of Hanoi
Lesson 8 of 14 • 0 upvotes • 11:14mins
Antim
In this video we will study the Tower of Hanoi problem with its example and procedure.
(Hindi) Data Structures: TNPSC
14 lessons • 2h 14m
1
Introduction to Data Structures (in Hindi)
15:00mins
2
Algorithm and their Complexity (in Hindi)
9:50mins
3
Arrays: Part 1 (in Hindi)
11:23mins
4
Array: Part 2 (in Hindi)
10:06mins
5
Stacks: Part 1 (in Hindi)
7:33mins
6
Arithmetic expression; Polish notation.
9:47mins
7
Example of notation conversion.
7:48mins
8
Tower of Hanoi
11:14mins
9
In this lecture we will study about the queues and their representation.
7:23mins
10
In this we will study the algorithm for insertion and deletion in queues.
7:13mins
11
Deques
6:44mins
12
Priority queues.
10:24mins
13
Introduction to Linked list.
10:47mins
14
Traversing in a linked list.
8:59mins
Crack TNPSC with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
