🧑🎓Join CAT VARC/DILR/Quant Mastery 3 months batch starting soon!
Edit MetaData
.The time required to search an elementin a linked list of length n is
$$O(\log_{2}n)$$
O(n)
O(1)
$$O(n^{2})$$
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!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!