This Library contains different implementations of the tree data structures, such as K-ary, binary, expression trees etc. A tree data structure can be defined recursively (locally) as a collection of ...

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.