Not understanding complexity


#1

why does adding the following base case results in TLE , after removing this condition it works completly fine.
if(s==e) { return root; }


#2

another base case –
if(s>e) return NULL;
Complexity–
T(n) =O(N) + 2T(n/2)
solving this recuurence will give you O(NlogN);