CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
The average depth of a binary searchtree is
$$ O(n^{0.5})$$
$$ O(n)$$
$$ O(\log n)$$
$$ O(n \log n)$$
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Day-wise Structured & Planned Preparation Guide
By proceeding you agree to create your account
Free CAT Schedule PDF will be sent to your email address soon !!!