Data Structures-II
Subject Overview
Data Structures-II moves from linear to non-linear and advanced structures — binary trees and binary search trees, height-balanced and multi-way trees (AVL, B-Tree, B+ Tree, Red-Black Tree, Heap), graphs and their traversal/shortest-path algorithms, and the classic searching and sorting algorithms with a comparative analysis. A 3-credit core theory paper.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: Trees
Definition and terminology, binary trees, array and linked-list memory representation, recursive and non-recursive traversal, threaded binary tree, binary search tree — insertion, deletion, searching
Unit 2: Advanced trees
Height-balanced (AVL) trees — insertion and deletion, M-way trees, B-Trees, B+ Trees, Red-Black trees, Heap trees
Unit 3: Graphs
Definition and terminology, types of graphs, memory representation, depth-first and breadth-first traversal, Dijkstra's shortest path algorithm
Unit 4: Searching and sorting
Linear and binary search, hashing, hash tables, hash function types, collision resolution (open addressing and chaining), bubble/selection/insertion/quick sort, comparative study of searching and sorting algorithms