Data Structure-II

Contents

1. Tree
1. Concept and Terminologies
2. Types of Trees
3. Representation of Binary Trees
3.1 Static Representation
3.2 Dynamic Representation
4. Operations on Binary Search Tree
4.1 Create
4.2 Tree Traversals
4.3 Search
4.4 Insert
4.5 Delete
4.6 Count Total Nodes
4.7 Count Leaf Nodes
4.8 Find Smallest/Largest Value
4.9 Copy
4.10 Compare
4.11 Mirror
5. Applications of Trees
5.1 Heap Sort
5.2 Introduction to Greedy Strategy

2. Search Trees
1. Concept and Terminology
2. AVL Tree
2.1 Definitions
2.2 Rotations
3. Red Black Tree
3.1 Operations on Red-black tree
4. Multiway Search Tree
4.1 B Tree
4.2 B+ Tree

3. Graph
1. Concept and Terminology
2. Graph Representation
2.1 Adjacency Matrix
2.2 Adjacency List
2.3 Adjacency Multilist
3. Graph Traversals
3.1 Depth First Search
3.2 Breadth First Search
4. Applications of Graphs
4.1 AOV Network – Topological Sort
4.2 Use of Greedy Strategy – Minimum Spanning Trees
4.3 Dijkstra’s Shortest Path Algorithm
4.4 Dynamic programming
4.5 All Pairs Shortest Path-Floyd Warshall algorithm
4.6 Use of Graphs in Social Networks

4. Hash Table
1. Concept of Hashing
2. Terminologies
3. Properties of a Good Hash Function
4. Hash Functions
5. Collision Resolution Techniques
5.1 Open Addressing
5.2 Chaining