Build a binary tree from a parenthesized string
A string encodes a binary tree as an integer followed by zero, one or two parenthesized subtrees, the left one first, for example 4(2(3)(1))(6(5)). Parse it into a tree and return the root.
No answer yet. Write the first one; the best answer gets endorsed.
