Given 2 ordered linked list L1 and L2, provide an efficient (linear time) function that deletes every element of L2 found in L1. Your function will be a friend function of class orderedLinkedListType.
Use the following header:
template%26lt;class Type%26gt;
void deleteOc(orderedlinkedListType%26lt;Type%26gt; %26amp;L1, const orderedlinkedList %26lt;Type%26gt; %26amp;L2)
Use your text Book: Data Structures using C++ (Malik)
HElp with Ordered linked list using C++?
Sounds like your homework to me...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment