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 1.7 Huffman coding Question Bank Short Answer Question bank Long Answer 2.1 Efficient Search trees : Terminology and Types. 2.2 AVL Tree 2.2.3 AVL Tree : Insertion. 2.3 Red Black Tree 2.3.3 Red Black Tree insertion and deletion 3.4.2 Greedy Strategy in Minimum Spanning Tree 3.4.2 i. Krushkal's Algorithm. 3.4.2 ii. Prim's Algorithm
