Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
GATE CS 2026 Mastery Course
·
Module 7
Data Structures
1
Dynamic Arrays, Strings, and Sparse Matrices
Analyze operations on dynamic arrays and strings as Abstract Data Types, and implement sparse matrix representations.
2
Stacks & Queues: Array & Linked List Implementations
Implement stacks and queues using both arrays and linked lists and apply them to solve problems like expression evaluation.
Linked List Operations: Insert, Delete, and Reverse
Perform insertion, deletion, and reversal operations on singly, doubly, and circular linked lists.
4
Binary Tree Traversal and Properties
Implement binary tree traversals (inorder, preorder, postorder, level-order) and compute tree properties like height and diameter.
5
Binary Search Tree Operations
Perform search, insertion, and deletion operations in a Binary Search Tree (BST) and find an element's inorder successor/predecessor.
6
AVL Tree Rotations
Restore the balance of an AVL tree after insertion or deletion using single and double rotations.
7
Heap Operations and Priority Queues
Implement binary heap operations (insertion, deletion, heapify) and use a heap to implement a priority queue.
8
Collision Resolution Techniques and Load Factor Analysis
Resolve hash collisions using chaining and open addressing (linear probing, quadratic probing) and analyze the effect of load factor.
Previous module
Programming in C & Recursion
Next module
Design & Analysis of Algorithms