I am unable to figure out my mistake in the implementation of https://mirror.codeforces.com/contest/343/submission/121547727

used Euler tour technique and segment trees for query 1: I have used lazy propagation to update all the nodes and also checked if any node in the subtree of the node is empty then made the parent of node empty for query 2: I have updated the node and made it empty for query 3: I have checked if all the nodes in subtree of a given node are filled then printed 1 else 2

but can't figure out my mistake getting WA on tc 6