Surya Teja Achanta

This course gives a detail introduction to binary trees, binary search trees, heaps etc. with some of the best examples and applications.

Programming

English

Trees and Heaps

Programming Languages

Trees

Intermediate

Competitive Programming

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Heaps & Priority Queues

This lesson is about overview of the new course "Trees and Heaps".

Course Overview

This lesson is about Introduction to Binary and binary search trees.

Introduction to Trees

This lesson is about implementation  of a complete binary tree.

Implementation of Binary Tree

Tree Traversals

This lesson is about level order traversing of a binary tree.

Implementation of Breadth First Traversal

This lesson is about implementation of preorder,inorder and post order traversals of a binary tree.

Implementation of Depth First Traversal

This lesson is about the implementation of functions,which find the minimum and maximum value of a given binary tree.

Finding Minimum and Maximum Value of a Tree

This lesson is about implementation of a binary search tree and printing the data of binary search tree in ascending order.

Implementation of a Binary Search Tree

This lesson is about finding the height of a given binary tree using a recursive function.

Finding Height of a Given Binary Tree

This lesson is about printing the data of all the nodes of a binary tree in vertical order fashion.

Vertical Order Traversal of a Binary Tree

This lesson is about implementation of a function that converts a given binary tree into its mirror binary tree.

Converting Given Binary Tree into its Mirror Tree

This lesson is about deleting of a node from binary search tree.

Deleting a Node from Binary Search Tree

This is an introductory class for  heap data structure.

Introduction to Heap Data Structure

This lesson is about heapifying of a complete binary tree into a min binary heap.

Implementation of Min Heap

This lesson is about heapifying a complete binary tree into a Max Heap.

Implementation of Max Heap

This lesson is about traversing and printing the data of all the nodes of a heap along with their levels.

Printing Level of Each Node of Heap

Pursuing B.Tech. from Cluster Innovation Centre, and cleared ACM ICPC Asia Amritapuri first round online programming contest. 

Abhishek Sehgal

The students will have a deeper insight of the data structures, linked lists, insertion and deletion of nodes. It covers all the important theoretical concepts and intuition behind the data structures, making it the building blocks for any programming enthusiast. The collection then deals with Stacks, Queues, Recursion Intuition, Binary Trees and Inorder Traversal. We see that Programming is nothing but writing functions/methods to manipulate data. The last part of the collection focuses on an introduction to the Graph, Matrix Representation and understanding Hashing. This collection will give students a complete understanding of the data structures and how and when they should be used.



In-depth And Comprehensive Detail On The Study Of Basic Data Structures

CSE Undergrad in NIT Durgapur. Interested in DS, Algo, Web Dev and food offcourse. 

Arka Roy

The course is about exploring one of the most popular tree implementation in competitive coding –Segment Tree. This course provides you with a hands-on experience about segment trees and its application in varieties of the question asked in competitive coding events. With a good knowledge of segment tree, you are qualified enough to cross that barrier of solving a moderate to difficult range query based question in which a brute force implementation would always land up in Time Limit Exceeded status.

Segment Tree Demystified

Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about a data structure called 'Tree'. This data structures is an important part of the family of data structures. Trees are used to represent hierarchical information. Most commonly used trees are binary tree. They are used as Binary search trees which in turn is used as AVL and Red and Black Tree. Binary search is also based on the concept of searching in bst.

Data Structures and Algorithms - Trees

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

Dhiman Mayank

In this course, Dhiman Mayank has discussed non-linear data structure. He has covered trees, operations on binary search trees, tree deletion, interview questions on trees, AVL trees with insertion, red-black trees, segmented trees, introduction to graphs, and graph representation extensively.

Introduction to Non-Linear Data Structures

SDE Amazon, Qualified for ACM ICPC Regionals (KGP & Gwalior 2k17) (Chennai & Amritapuri 2k16).

Adarsh Singh Gaharwar

This is a beginner level course on graph theory and its application. In this course, Adarsh has tried to explain graphs from scratch and explained the basics of graph theory. This course contains 8 lessons. In first 7 lessons he has discussed graph representation and its traversal techniques and in the 8th lesson Adarsh has discussed a famous beginner level problem(BUGLIFE) from SPOJ and implemented it in C++.

Introduction to Graph Theory

This course covers Divide and Conquer and Binary Heaps and Hashing in detail with problems for computer science students and programming enthusiasts.

Lessons

16 lessons • 3h 3m

Invalid Date

NaN

Course Overview

Invalid Date

NaN

Introduction to Trees

Invalid Date

NaN

Implementation of Binary Tree

Invalid Date

NaN

Tree Traversals

Invalid Date

NaN

Implementation of Breadth First Traversal

Invalid Date

NaN

Implementation of Depth First Traversal

Invalid Date

NaN

Finding Minimum and Maximum Value of a Tree

Invalid Date

NaN

Implementation of a Binary Search Tree

Invalid Date

NaN

Finding Height of a Given Binary Tree

Invalid Date

NaN

Vertical Order Traversal of a Binary Tree

+ See all lessons