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.

Programming

English

Segment Tree Demystified

Competitive Programming

Trees

Intermediate

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.

This lesson covers an Introduction to Segment Trees and why we need this data structure, how time complexity is reduced for query updates and how a segment tree works.

Introduction to Segment Tree

This lesson introduces you to the construction of a segment tree and how recursion is used to build the segment tree array.

Building the Segment Tree

This lesson introduces you to Querying on the segment tree and its mechanism along with a sample question.

Query on Segment Tree

This lesson teaches you about updating the segment tree. Update operation on the input array can be performed with corresponding updates on the segment tree array and that's what is covered in this lesson.

Update on Segment Tree

This lesson introduces you to the idea of lazy propagation in the segment tree and how it can be effectively used to cut down the time complexity for worst case in range update problems.

Lazy Propagation on Segment Tree

Now that you covered all the basics of segment tree things gets complicated and long when implemented in normal way. In this lesson you will learn about keeping all the segment tree functions together in a segment tree class and also we will have a quick look at all the segment tree operations learnt so far before we proceed on to solving problems.

Let's Put It All Together

A sample problem ( beginner level ) has been solved in this lesson and how to approach this kind of questions has been shown. It is recommended that you pause the video after reading the question and think about a possible solution.

Solved Problem 1

This is an intermediate level question based on segment tree and lazy propagation asked in Codechef Long Challenge. For understanding the solution you also need an idea about a few kinds of the stuff mentioned in the lessons.

Solved Problem 2

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

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

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.

Trees and Heaps

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

8 lessons • 1h 11m

Invalid Date

NaN

Introduction to Segment Tree

Invalid Date

NaN

Building the Segment Tree

Invalid Date

NaN

Query on Segment Tree

Invalid Date

NaN

Update on Segment Tree

Invalid Date

NaN

Lazy Propagation on Segment Tree

Invalid Date

NaN

Let's Put It All Together

Invalid Date

NaN

Solved Problem 1

Invalid Date

NaN

Solved Problem 2