I was called and we set up a time for a 1-hour phone interview. During the interview, I was asked to write code in whatever language I was most comfortable in and answered a series of questions. For each question, once I finished the initial part, I was then asked to tweak the program to make it work for a different solution.

The interview was a month or two ago, and I was told that I would hear back within a week, but was never contacted.

Given the object below, create a function (Node root) that sums the values of every node in the binary tree represented by root.

Write a function (int n) that prints the integers from 1 to n (inclusive). But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”.

-- This question was altered, and they eventually asked me to make it general for an array of values and a complementary array of strings to print if the given value was found.

Write a function that returns the sum of all of the values in the list.