I'm a Software Engg student at Thapar University. Through my courses I'll try to explain CS related and some other subjects to all easily.

Meghna Mishra

This course covers important data structures - stack, queue, traversal in binary trees, BFS and DFS, Kruskal's algorithm, Prim's algorithm etc. It defines a series of steps to be executed in a certain order to obtain the desired output.

CBSE Class 12

Hindi

(Hindi) Important Data Structures and Algorithms

Algorithms

Programming Languages

Crash Course

Computers - Crash Course

Computer Science

Class 6-12

Become a topper in your school and ace your board exams by learning from best educators in the country

CBSE

CBSE (Central Board of Secondary Education)

This will give you an insight into Queues.

Queues (in Hindi)

Stacks (in Hindi)

In-Order Traversal of Binary Tree (in Hindi)

Post-Order Traversal of Binary Tree (in Hindi)

Polish Notation and evaluation of postfix notation

Polish Notation (in Hindi)

Breadth First Search (in Hindi)

Depth First Search (in Hindi)

Prim's Algorithm (in Hindi)

Kruskal's Algorithm (in Hindi)

Greedy Algorithm - Job Sequencing (in Hindi)

Pursuing BTECH from Guru Jambeshwer University,Hisar
Passionate and optimistic

Simran Thukral

This Course covers Data structures, which is an important subject in computer science.These lessons are very beneficial to students.The content is taught in a very interactive and efficient manner.

(Hindi) Data Structures

Myself Vaibhav, a B.tech Student, one word to define me is Createambitiople (Creative, Ambitious, Simple) and a gamer.

Vaibhav Heda

This Course is related to html document, how to create web pages using HTML and is for students of class 10-12

HTML : CBSE Class 12 Board

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course is about algorithms and data structures and it will focus more on competitive programming and interview questions.

(Hindi) Learning Data Structures and Algorithms

Student studying in VIT university, Pursuing undergrad in IT(information tech),
loves to code and teach.

Kusumanchi Vineeth

In this course, Kusumanchi Vineeth discusses regarding Expression tree, binary search tree, DFS algorithm, AVL tree and Dijkstra's algorithm.

Lessons

10 lessons • 40m

Invalid Date

NaN

Queues (in Hindi)

Invalid Date

NaN

Stacks (in Hindi)

Invalid Date

NaN

In-Order Traversal of Binary Tree (in Hindi)

Invalid Date

NaN

Post-Order Traversal of Binary Tree (in Hindi)

Invalid Date

NaN

Polish Notation (in Hindi)

Invalid Date

NaN

Breadth First Search (in Hindi)

Invalid Date

NaN

Depth First Search (in Hindi)

Invalid Date

NaN

Prim's Algorithm (in Hindi)

Invalid Date

NaN

Kruskal's Algorithm (in Hindi)

Invalid Date

NaN

Greedy Algorithm - Job Sequencing (in Hindi)