Euler tour 3 Graph

#1

I dont know to apply segment tree with lazy propogation on Euler tour . Please give me the detailed solution.

#2

@trojan_code
Please watch the video of Euler tour once. After you have done that, please follow the following steps.

  1. The timein of every node in the tree is a unique property of that node.
  2. Thus we build the seg tree using the timein of every node.

Timein of first node is 1 and of the last node is n(considering there are n nodes in the tree).

Try implementing it using the above hint.
If you face any issues,feel free to ask.

If my answer is able to solve your query,please mark the doubt as resolved.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.