LeetCode - 108 Convert Sorted Array to Binary Search Tree

class Solution {
public:
    TreeNode *fun(vector<int> &num,int i,int j)
    {
        if(i>j){
            return NULL;
        }
        else{
            int mid=(i+j)/2;
            TreeNode *t=new TreeNode(num[mid]);
            t->left=fun(num,i,mid-1);
            t->right=fun(num,mid+1,j);
            return t;
        }
    }
    TreeNode *sortedArrayToBST(vector<int> &num) {
        return fun(num,0,num.size()-1);
    }
};