Back to course home
0% completed
Vote For New Content
Why is space complexity of Find operation naive implementation O(1), even with recursive function calls?
akshayavb99
Feb 24, 2025
Since naive implementation uses a recursive function call to find the parent, and in the worst case the function is called n times. In this case, wouldn't the space complexity be O(n) instead of O(1)?
0
0
Comments
Comments
On this page