University of Washington Separate Arrays Variables Questions
Description
1) Your colleague’s code compiles, and sometimes it works, but sometimes it doesn’t. They show you this. What is wrong?
template<class Object>
void LList<Object>::remove( const Object &x ) {
LListNode<Object> *current = findPrevious( x );
if ( current == NULL )
return;
LListNode<Object> *deletedNode = current->next;
current->next = current->next->next;
}
2) You have a fixed sized set of items that you are storing. Access time is incredibly important. What underlying data structure would you use for this list?
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."
