Binary Search Code Doubt(Recursion)


I made a code for Binary search using recursion which works fine. While revisiting the concepts of recursion I got confused. I haven’t mentioned ‘return’ before any of the recursive function calls and still the code is working fine. Why so? Isn’t the return keyword necessary? Even if we find the element at some point, how will the just previously made call return the value to the predecessor function call without any return statement?