1. Assume that the position of an item to be removed from a singly linked structure has been located. State the run-time complexity for completing the removal operation from that point.
2. Can a binary search be performed on items that are in sorted order within a singly linked structure? If not, why not?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here