You need to use removelazy in your query function

First of all you are consider 0 base indexing in your build() function so your left child is (node1 << 1) + 1 and right child is (node1 << 1) + 2 and your query() function is

node query(int node1, int l, int r, int start, int end1) {

if (tree[node1].lazy) {
    removelazy(node1, l, r);
}

node req;
if (l > end1 || r < start)return req;
if (l <= start && end1 <= r)return tree[node1];
int mid = (start + end1) >> 1;
node a = query((node1 << 1), l, r, start, mid);
node b = query((node1 << 1) + 1, l, r, mid + 1, end1);
merge1(req, a, b);
return req;

}

You do not consider if(tree[node1].lazy != 0) case in your query function