Developing a pure recursive algorithm to return the reverse of a singly linked list ..
Posted on 2000-04-03
Can anyone help me develop this algorithm?
We are not allowed to use ANY assignment statements ..
The methods that we have at our disposal are:
first(list): returns the data value of the first element in 'list'
rest(list): returns a pointer to the second element in 'list'
isMember(object, list): determines if object is in the list .. returns true or false ..
deleteFirst(object,list): returns the same list but with the first instance of 'object' in the list omitted ..
deleteAll(object,list): returns the same list but with all instances of 'object' in the list omitted ..