Search⌘ K
Home
Courses
Algorithms for Coding Interviews in C++

Solution: Binary Search on Singly Linked List

Explore how to perform binary search on a singly linked list using a divide and conquer strategy. This lesson teaches you to find the middle node with two pointers and then apply binary search logic despite the lack of direct access, helping you solve linked list search problems with a clear approach.

We'll cover the following...

Solution

Performing Binary Search requires figuring out the middle element. Binary Search is efficient for arrays because arrays are contiguous and accessing the middle index between two given indices is easy and can be done in O(1)O(1).

Memory allocation for the singly linked list is dynamic and non-contiguous, which ...