No, space complexity will b O(logn) only..

Space complexity= space required other than provided input+ depth of recursion tree..

Now,

Space required other than provided input= O(1) and depth of recursion tree=O(logn)...

Therefore overall space complexity=O(1)+O(logn)=O(logn)....