佬 帮我看一下为什么RE了

#include<bits/stdc++.h>
using namespace std;
void build_tree(int arr[], int tree[], int node, int start, int end) {
    if (start == end) {
        tree[node] = arr[start];
    }
    else {
        int mid = (start + end) / 2;
        int left_node = 2 * node + 1;
        int right_node = 2 * node + 2;
        build_tree(arr, tree, left_node, start, mid);
        build_tree(arr, tree, right_node, mid + 1, end);
        tree[node] = tree[left_node] + tree[right_node];
    }
}
void update_tree(int arr[], int tree[], int node, int start, int end, int L,int R, int val) {
    if (start == end) {
        arr[start] += val;
        tree[node] += val;
    }
    int mid = (start + end) / 2;
    int left_node = 2 * node + 1;
    int right_node = 2 * node + 1;
    if (L <= mid) update_tree(arr, tree, left_node, start, mid, L, R, val);
    if (R > mid) update_tree(arr, tree, right_node, mid + 1, end, L, R, val);
    tree[node] = tree[left_node] + tree[right_node];
 }

int query_tree(int arr[], int tree[], int node, int start, int end, int L, int R) {
    if (L > end || R < start) {
        return 0;
    }
    else if (L <= start && R >= end) {
        return tree[node];
    }
    else if (start == end) {
        return tree[node];
    }else{
    int mid = (start + end) / 2;
    int left_node = 2 * node + 1;
    int right_node = 2 * node + 2;
    int sum_left = query_tree(arr, tree, left_node, start, mid, L, R);
    int sum_right = query_tree(arr, tree, right_node, mid + 1, end, L, R);
    return sum_left + sum_right;
    }
}
int main() {
    int n, m;
    cin >> n >> m;
    int arr[1000010] = {};
    int tree[1000010] = {};
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    build_tree(arr, tree, 0, 0, n - 1);
    while (m--) {
        int t,L,R;
        cin >> t>>L>>R;
        if (t == 1) {
            int j;
            cin >> j;
            update_tree(arr, tree, 0, 0, n-1, L, R, j);
        }
        else {
            cout << query_tree(arr, tree, 0, 0, n-1, L, R) << endl;
        }
    }
}