Welcome to the Treehouse Community
The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.
karan BadhwarWeb Development Techdegree Student 15,266 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 Parker217,506 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.