Yes, but it doesn't really make sense to have binary search on a linked list as moving to middle node logic will not be straight forward. For this we should have pointers of all nodes stored in an array. Or we can use binary tree linked list to apply binary search efficiently.

No, binary search is impossible on a linked list.

Yes, binary search is possible on linked list. It is as efficient as binary search on arrays.

all of the above are true.

Answer :(A)

Yes, but it doesn't really make sense to have binary search on a linked list as moving to middle node logic will not be straight forward. For this we should have pointers of all nodes stored in an array. Or we can use binary tree linked list to apply binary search efficiently.

Description :

Yes, but it doesn't really make sense to have binary search on a linked list as moving to middle node logic will not be straight forward. For this we should have pointers of all nodes stored in an array. Or we can use binary tree linked list to apply binary search efficiently.