Q1 -> Given a binary tree, return true if a node's value is the average of all its children (also includes its grandchildren)
Q2 -> Given K sorted lists (interviewer changed the requirement from arrylist to linked list and then back to arry list), design an iterator that has 2 functions next() to give us the next element and hasNext() to check if next element exists.