Data Structures and Algorithms - II Table of Contents Course Outline 1.1 Trees : Concept and Terminologies 1.2 Types of Binary Trees 1.3 Representation of Trees 1.4 Implementation and Operations on Binary Search Tree (BST) 1.5 Applications of Trees: Heap Sort 1.6 Greedy Strategy and Huffman coding Question Bank Short Answer Question bank Long Answer 2.2 AVL Tree 2.3 Red-Black Trees 2.4 Multi-way Search Trees 3.1 Graph : Concept and Terminologies 3.2 Graph Representation 3.3 Graph Traversals 3.4 Applications of Graphs 4.1 Hash Tables : Concept of Hashing 4.2 Terminologies 4.3 Properties of a Good Hash Function 4.4 Hash Functions 4.5 Collision Resolution Techniques Review and Practice