Given a string that contains ternary expressions. The expressions may be nested, task is convert the given ternary expression to a binary Tree

Input: "a?b:c"
Output: "(( < b > ) < a > ( < c > ))"

Input: "a?b?c:d:e"
Output: "((( < c > ) < b > ( < d > )) < a > ( < e > ))"