Contents: Introduction to trees, Tree Terminology, General trees, Binary trees, KD tree, Tree as ADT, Conversion of general tree into binary tree, Representation of tree using sequential and linked list, Binary tree and its types, Properties of Binary trees, Binary search tree and operations on binary search tree, Depth First and Breadth First traversal, Tree traversal techniques: inorder, preorder, postorder traversal (recursive and non-recursive traversal)

Contents: Threaded Binary Tree-concept, Operations on TBT (insert, delete, search, update, and traversal), time complexity and space complexity for tree operations, and Applications of trees.

Contents: Height balanced trees concepts ,Types of height balanced trees and applications, AVL Trees and operations

Contents:  Multiway trees: concepts, Types of multiway trees: B and B+ Trees operations on multiway trees and applications, Time complexity and space complexity for tree operations.

Contents: Graph Concepts, Terminology,Storage representation, Adjacency matrix, adjacency list, adjacency multi list, inverse adjacency list. Traversals - depth first and breadth first, Minimum spanning Tree, Prims and Kruskal Algorithms, Dikjtra’s Single source and multi-source shortest path, Topological ordering applications of graphs.

Contents:  Concept of Heaps, Types of heap, Operations on Heap – insert, delete, up-heapify and downheapify, use of heap in heap-sort, Fibonacci heap.

Contents: Concept of Disjoint Sets, Disjoint Sets as ADT, Up Trees, Smart Union and Path compression.

Contents:  Probabilistic data structures concept and Types of Probabilistic data structures: Membership Bloom Filters,

Contents: Bloom Filters, Cuckoo Filters, Cardinality: Linear counting, HyperLogLog, Frequency: Count-Min Sketch , Similarity: Minhash, SkipLists , Applications of Probabilistic data structure structures.