i am unable to figure out my mistake in implementation of https://codeforces.net/contest/343/submission/121547727

used euler tour technique and segment trees for query 1: i have used lazy propogation to update all the nodes and also checked if any node in subtree of 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 given node is filled then printed 1 else 2

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