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.

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

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

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

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

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

English

All questions

Trees

Intermediate

Competitive Programming

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

Abhishek Sehgal

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

Arka Roy

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

Dhiman Mayank

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

SELF STUDY