This assignment begins with 2 review questions that are not as much specific to the material in the book as they are to material you should have learned in prior courses or work experience. The final 3 questions focus on material central to success in the remainder of this course!
Part B: Write, in legal Pascal or C, the declarations of a recursive function that will return the total of all the value fields in a tree when given, as a parameter, a pointer to the root vertex of that tree.
From base 5: 41 432 4321
From base 8: 35 666 4321
From base 16: A DAD FEED
Base 5
Base 8
Base 16
F0E1D2C3
B4A59687