Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.Start your free trial
karan BadhwarWeb Development Techdegree Graduate 18,135 Points
How the space complexity is still O(logn) we call the function on every recursive call that adds up to the space and puts up the memory on the stack? How it is still considered O(logn)?
Steven Parker228,991 Points
The function itself will still have the same complexity no matter how it is used. But the code it is being called from might have a higher complexity.