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.



Programming

English

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

Algorithms

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 vibrant class begins with an explanation of a data structure, which is a way to store and organize data on a computer so it can be used efficiently and this is followed by an illustration that explains how data works. It then moves on to explain why we need a code to reduce the time complexity and hence the idea of data structures came into being. The lesson ends with a highlight on goals behind data structures.

Data Structures - Introduction & Goals

The lesson starts by explaining an array, which is a data structure that can store a fixed-size contiguous collection of elements and the linked list, which is a more dynamic version of the array but the nodes connected via links doesn't have to be stored in memory sequentially. There are multiple illustrations that show how each of these work differently. 

Linked List - Introduction

We see through illustrations in this lesson as to how in the linked list we always store the address of the first node in a pointer variable to the node type and to access or manipulate the list, we just need the address of the first node. 

Linked List: Implementation(C++)

The lesson begins with an explanation of the creation of a linked list. It then highlights on how we can insert a node at the beginning of a linked list and what to do if the list is empty. There are multiple illustrations that help in a better understanding of the concept.

How To Insert A Node At The Beginning Of A Linked List

The lesson begins with an illustration of the layout of the linked list. It then explains the structure of how we can insert a node at the end of a linked list and what to do if the list is empty. There are varied examples that will help you get a better understanding of how to insert the node. 

Data Structures: Inserting A Node At The End Of A Linked List

This lesson deals with how we can print a linked list. We see that to print a linked list we only need the address of the first node, once we have that we can print the data contained by the first node and through that we can access the second node and then iterate through the whole list until we encounter a Null. The lesson then has multiple examples of how this can be done. 

Basic Data Structures: Print A Linked List

In this lesson, Abhishek Sehgal begins by explaining the parameters needed to insert a node at the nth position of a linked list. It also highlights on how to insert a node at a specific position and the steps used to create it. There are many illustrations and examples of the same, this will give you a better understanding of the topic. 

Data Structures: Insert A Node At The Nth Position Of A Linked List

This lesson by Abhishek Sehgal begins with an explanation of how to delete a note at the beginning of a list,  the function that is used and an illustration to explain this. After this there are many examples and more diagrammatic representations that will help you get the concept of deleting a node.

Data Structures: Deleting A Node From Beginning Of The List

This lesson concentrates on educating us on how to delete the node at the ending of a linked list. We are made aware of the functions, parameters and the function's return type.
There are various diagrammatic representations and codes which help in understanding the concept. There is light shed on a few special cases.

Delete A Node From The Ending Of The List

This lesson focuses on deleting the nth node from the linked list. In this, Abhishek is going to help us in deleting the specific node specified by the user at which position the node is standing and we are going to learn how to delete that node. It throws light on stepwise deletion of the node along with the illustrations.


Delete The Nth Node From The Linked List

A linked list can be reversed by two methods: Recursive and Iterative method. This lesson focuses on Iterative method for Reversing a Linked List with the help of illustrations. 

Reversing A Linked List (Iterative Method)

This lesson focuses on the definition of recursion and how to trace a recursive function. The concepts are being described with the help of examples and illustration for better understanding.

Intuition Behind Recursion Part 1

This lesson provides a description about the recursive function for computing factorial of a number and helps trace down the recursion using the concept of run-time stack and activation record.

Intuition Behind Recursion Part 2

This lesson explains how to print a linked list in reverse order using recursion. Recursive function reverse_print is explained with the help of an illustration and its simulation is shown using run-time stack and activation record.

Print A Linked List In Reverse Order

This lesson explains the recursive method to reverse a linked list. Recursive function reverse is explained with the help of an illustration and its simulation is shown using run-time stack and activation record. 

Reversing A Linked List Recursively

This lesson provides an introduction to the doubly linked list, and how is it different from the singly linked list (the linked list structure we have studied so far). It also discusses how we can create the structure of a node for a doubly linked list in C++. 

Introduction To Doubly Linked List

The lesson begins with an illustration of the layout of the doubly linked list. It then explains how we can insert a node at the beginning and end of a linked list. Differences between the singly linked list and doubly linked list in case of insertion are also discussed.

Implementation Of Doubly Linked List In C++

This lesson explains how we can traverse a doubly linked list. Both traversal forward (using next pointer) and backward (using the previous pointer) are explained with the help of an illustration. This lesson is for all the people looking to learn data structures in Computer Programming. 


Traversal In Doubly Linked List

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

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

18 lessons • 2h 50m

Invalid Date

NaN

Data Structures - Introduction & Goals

Invalid Date

NaN

Linked List - Introduction

Invalid Date

NaN

Linked List: Implementation(C++)

Invalid Date

NaN

How To Insert A Node At The Beginning Of A Linked List

Invalid Date

NaN

Data Structures: Inserting A Node At The End Of A Linked List

Invalid Date

NaN

Basic Data Structures: Print A Linked List

Invalid Date

NaN

Data Structures: Insert A Node At The Nth Position Of A Linked List

Invalid Date

NaN

Data Structures: Deleting A Node From Beginning Of The List

Invalid Date

NaN

Delete A Node From The Ending Of The List

Invalid Date

NaN

Delete The Nth Node From The Linked List

+ See all lessons