Space Complexity of searching in a Search Tree - Analysis

Thanks for subscribing!

---

This video is about space complexity analysis for searching in Search Trees.
In the video the following concepts are explained:
- Searching in Search Trees ( recursive / iterative )
- Coming up with a recurrence equation ( in terms of the height of the tree )
- Deriving the closed form from a recurrence equation
- The space complexity in terms of big oh for searching, based on a closed form

Note that based on this video, time complexities can be derived using the same approach for Search Trees ( thus in terms of the height ).

---

If you thought this video was useful, make sure to give it a like!
If you want to support this channel, make sure to subscribe.
If you have any questions, use the comment section.

This video has been published by MisterCode.