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.

CBSE Class 12

English

Data Structures and Algorithms - Expression Tree, AVL Tree, DFS and Djikstra's Algorithm

Interview Preparation

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 lesson is about the expression tree. You will understand how the operations in the expression can be put in the form of the binary tree.
Such operations in the form of a binary tree is called an expression tree.

Expression Tree

This chapter is about the brief explaination of the operations involved in the binary search tree.
It involves briefly about their operations and the algorithms.

Binary Search Tree

A clear lesson about the DFS and BFS algorithms.
DFS and BFS algorithms are explained using queue and stack with clear steps involved in it.

Depth First Search (DFS) Algorithm

This lesson is about the AVL tree and its algorithms with examples for every rotation that takes place.

AVL Tree

A lesson about finding the shortest distance algorithm i.e. dijkstra's algorithm with various applications and examples.

Dijkstra's Algorithm

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

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.

(Hindi) Important Data Structures and Algorithms

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.

Lessons

5 lessons • 52m

Invalid Date

NaN

Expression Tree

Invalid Date

NaN

Binary Search Tree

Invalid Date

NaN

Depth First Search (DFS) Algorithm

Invalid Date

NaN

AVL Tree

Invalid Date

NaN

Dijkstra's Algorithm