Considering a singly linked list of integers implementation, assuming that elements of the list are always in ascending order, write a function (find_median) that finds and returns median value. The function cannot scan the list more than ONCE. Note that there is no member variable _size that keeps track of the number of element in the linked list

class SinglyList:
class _Node:
def __init__(self, e, next):
self._element = e
self._next = next

def __init__(self):
self._head = self._tail = None

def find_median(self):

Answer rating: 100% (QA)

if curnext is None return curelement count 1 while curnext cur curnext cur selfhead count 1 cur self... View the full answer