**Hello Codechef community.**

`I am currently working on a course focusing on techniques which are use to answer queries which are asked on trees like Mo's algorithm on trees , HLD , merge smaller into bigger and so on.`

**Here is the list of lectures made till now**

L00 : Course Overview

L01 : Euler Tree Technique / Tree Flattening

L02 : Tree & Queries | Codeforces | Rated 2400 (Explaining Mo’s on tree)

L03 : Tree & Queries Part 2| Codeforces | Rated 2400 (Explaining Mo’s on tree)

L04 : Path Queries & Mo’s Algorithm

L05 : GOT (SPOJ) : Application of Mo’s algorithm on path query

L06 : Introduction to Centroid Decomposition & Related Problems

L07 : Height and Structure of Centroid Decomposition

L08 : Building Centroid Decomposition Tree (C++ Implementation)

More lectures will be added soon

any suggestion is welcome.

Tank you for your precious time.

CodeNCode