Skip to content

Data Structures- II ( Solved Syllabus )

UNIT 1

Trees: Definition, Terminologies, Binary Trees, Memory representation of Tress using Array
and Linked List, Recursive and non-recursive Traversal of Binary Tree, Threaded Binary Tree,
Binary Search Tree, Inserting, Deleting and Searching in Binary Search Tree.

UNIT 2

Advanced Trees: Height Balanced Trees: AVL Trees, Insertion and Deletion in AVL Tree, M
way Tree, Insertion and Deletion in M way Tree, B Tree, Insertion and Deletion in B Tree,
B+ Tree, Red-Black Tree, Heap Tree.

UNIT 3

Graphs: Definition, Terminologies, Types of graphs, Representation of graph in
memory, Traversal (Depth First Search and Breadth First Search), Shortest Path algorithm Dijkstra’s Algorithm.

UNIT 4

Searching: Linear Search and Binary Search, Hashing, Hash Tables, Types of Hash Functions,
Collision, Collision Resolution with Open Addressing and Chaining


Sorting: Bubble Sort, Selection Sort, and Insertion Sort, Quick Sort.
Comparative study of various searching and sorting algorithms.