How is the space complexity O(LogN) for rangeSumBST problem
The space complexity is the amount of space used, which is essentially the size of your call stack in your deepest line of recursion. The runtime is indeed $O(N)$ but the space complexity is $O(H)$ where H is the height of the tree.
Even following the link you provided, they state this: