Can our linked lists do inefficient things like traverse the list just to get to the last node?
A. No. If you design your list correctly, that will not be needed. You’ll only traverse the whole list when you do things like print it. • Q. Can we use the solutions given as is or must we only use them to fix our code? A. You can take them as is or you can pick and choose parts you need. If you do the latter, of course, you must adapt what you pick to how your code works. The BigNum code should work as is, but you will have to add stuff to the NetworkNode class. • Q. My BNQueue size() member function traverses the whole queue to find the size…Should I do this more efficiently? A. Yes. What we learned with the String class applies. • Q. Should the BigNum output format for numbers of base 10 or lower still be <1><2><3><4><5><6>_{10}, or should it be 123456_{10}? A. Assignment 4 defined the output format to be <1><2><3><4><5><6>_{10}. Since we have not changed it for Assignment 5 or 6, it should remain that for all numbers, irrelevant of base. All Assignment 5 did was to change the fo
