Data Structures

Overview : It is the foundation of the subject and mostly constitute basic operations on arrays.

Important topics : Time Complexity, Sorting algorithms and representation of arrays in memory.

End Advice : It is an easy unit, make sure to study it well. You can use GPT and make sure to solve all pyqs

Overview : This unit comprises the idea of stacks and queues along with their operations.

Important topics : Infix to postfix conversion (very important), implementation of stacks and queues

End Advice: Question can be framed potentially from any topic so don't leave anything but make sure to atleast study the important topics.

Overview : It can be a bit difficult in comparison to previous units but make sure to atleast study linked list well.

Important topics : Operations on linked list is very important ( insertion, deletion, traversal, etc)

End Advice: Focus on linked list more but don't leave recursion as it will be used in trees later.

Overview : It is the most tough unit in this subject but many questions are asked from this unit.

Important topics : Postorder, preorder and inorder traversal ( very important ), finding postorder by given inorder and preorder or vice versa, Insertion and Deletion in BST, Insertion in AVL tree

End Advice : Give this unit major time as it can considerably impact your grades.

Overview - It is also very hard unit after trees but sorting is relatively easy to understand, focus on it for grades.

Important Topics - Sorting, Hashing, Topological Sorting

End Advice: I would advise to study BFS and DFS as well. Graph traversal code is rarely asked, you must know how to write traversal for a given graph.