* Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below.