1. Implement the ADT for the objects on Santa Claus’s nice list . Then write a program for Santa that maintains his two lists of those who are naughty and those who are nice.
2. A tail pointer is a pointer variable to the last node in a chain of linked nodes. Write a link-based implementation for a class of double-ended lists, that uses both a head pointer and a tail pointer.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here