arrow_back
Introduction to Data Structures
Introduction to Data Structures
You Tube video on Introduction to data structures
Brief intro to 1-D arrays
Brief introduction to 2-D arrays
Brief introduction to stacks
Brief introduction to queues
Brief introduction to linked lists
Brief introduction to trees
Brief introduction to graphs
Brief introduction to computer memory
Basics of algorithms
Learning to write algorithms
Selection construct
repeat while loop
Repeat for loop
Finding sum of array elements
Finding the biggest in an array
Difference between return and end statement
Matrix addition algorithm
Logic of matrix multiplication
Matrix multiplication algorithm
Introduction to complexity
Big O notation
Implementation of 1-d & 2-d arrays
Introduction to structure of C programs
Downloading & installing Dev C++ IDE
Declaring & initalising 1-D arrays
Reading and accessing elements of 1-D Arrays
Getting sum & average of array elements
Getting the highest value among elements
Reading & accessing 2-D array elements
Matrix addition code
Matrix multiplication code
Implementation of searching techniques
Linear search explanation & algorithm
Linear search code
Explanation of binary search
Binary search algorithm
Binary search code
Implementation of sorting techniques
Flow of logic of bubble sort
Bubble sort code
Bubble sort algorithm
Flow of logic selection sort
Selection sort code
Selection sort algorithm
Stacks & queues
Basics of stacks - Part 1
Basics of stacks - Part 2
Algorithm to push an element into a stack
Algorithm to pop an element from a stack
Basics of queues
Algorithm to insert an element into a queue
Algorithm to delete an element from a queue
Revising pointers in C
Basics of pointers
Pointers in action - Part 1
Pointers in action - Part 2
Pointers to pointer
Pointer arithmetic
Subtracting two pointer variables
Arrays & pointers
Dynamic memory allocation - Part 1
Dynamic memory allocation - Part 2
Revising functions in C
Basics of functions
Practical approach to functions - Part 1
Practical approach to functions - Part 2
Practical approach to functions - Part 3
Pointer to arithmetic
Scope of variables - Part 1
Scope of variables - Part 2
Global variables
Name clashing between local & global variables
Some facts about return statement
Call by value
Call by reference
Passing an array to a function
Revising structures in C
Basics of structures
Creating a structure & accessing members
Working with multiple structures
Pointer to structure
Array of structures
Alternative method of declaring structures
Passing a structure to a function
Passing a structure to a function by reference
Implementation programs of stacks & queues
Programs of pushing & popping elements in a stack
Programs of inserting & deleting elements in a queue
Algorithms to insert nodes in a linear linked list
Revision of basics of linear linked lists
Traversal of linear linked list
Inserting a node in the beginning of a linear linked list - Part 1
Inserting a node in the beginning of a linear linked list - Part 2
inserting before a given node in a linear linked list - Part 1
inserting before a given node in a linear linked list - Part 2
Inserting after a given node in a linear linked list
Algorithms to delete a node in a linear linked list
M8_T3_E1_deleting_first_node
M8_T3_E2_deleting_a_given_node_PART_1
M8_T3_E3_deleting_a_given_node_PART_2
Programs of creation, insertion & searching in a linear linked list
Creation of a linear linked list
Inserting a node in the beginning of a linear linked list
Searching a node in a linear linked list
Inserting a node before a given node in a linear linked list
Insert after a given node in a linear linked list
Inserting a node at the end of a linear linked list
Programs of deletion in a linear linked list
Deleting the first node in a linear linked list
Deleting a particular node in a linear linked list
Deleting a last node in a linear linked list
Algorithms of traversal & insertion in a circular linked list
Traversal of a circular linked list
Inserting a node in the beginning of a circular linked list
Inserting a node before a given node in a circular linked list
Inserting a node after a given node in a circular linked list
Algorithms of deletion in circular linked list
Deleting the first node in a circular linked list
Deleting a particular node in a circular linked list
Implementation programs of traversal & insertion in a circular linked list
Creation & traversal of a circular linked list
Inserting a node in the Beginning of a circular linked list
Inserting a node after a given node in a circular linked list - Part 1
Inserting a node after a given node in a circular linked list - Part 2
Implementation programs of deletion in a circular linked list
Deleting a particular node in a circular linked list
Algorithm of traversal & insertion into a doubly linked list
Traversal of a doubly linked list in both the directions
Inserting before a given node in a doubly linked list
Inserting after a given node in a doubly linked list
Algorithms of deletion in a doubly linked list
Deletion of a particular node in a doubly linked list
Implementation programs of creation & traversal of a doubly linked list
Creation of a doubly linked list
Traversing a doubly linked list in both the directions
Inserting at the beginning of a doubly linked list
Inserting a node before a given node in a doubly linked list
Inserting a node after a given node in a doubly linked list
Implementation programs of deletion in a doubly linked list
Deletion of the first node in a doubly linked list - Part 1
Deletion of the first node in a doubly linked list - Part 2
Deletion of the last node in a doubly linked list
Deletion of a particular node in a doubly linked list - Part 1
Deletion of a particular node in a doubly linked list - Part 2
Understanding trees
Revision of introduction to trees
Two representations of a binary tree in memory
Height of a binary tree
Traversal of a binary tree - explanation & algorithms
Explanation of pre-order traversal of a binary tree
Explanation of in-order traversal of a binary tree
Explanation of post-order traversal of a binary tree
Algorithm of pre-order traversal of a binary tree
Algorithm of in-order traversal of a binary tree
Algorithm of post-order traversal of a binary tree
Binary Search Tree (BST)
Basics of binary search tree
Second example of a BST
Heaps
Basics of a heap
Insertion in a heap
Deletion of root node in a heap
AVL tress (Height balanced tree)
Basics of a height balanced trees (AVL trees)
Basics of graphs
Basics of graphs and their types
Representation of graphs through adjacency matrix
Representation of graphs through linked lists
Introduction to maps and hashing
Basics of maps
Basics of hash functions