Last 4 months ๐งโ๐ Get upto 70% Off on CAT 2024 courses today ๐ Enroll now
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!
Detailed syllabus & Topic-wise Weightage
By proceeding you agree to create your account
Free CAT Syllabus PDF will be sent to your email address soon !!!