title: Parsing a string of given format to build a binary decision tree
body: <p>I'm trying to parse a string with parentheses of the form <code>((Question)(Left_Node)(right_node))</code>.</p>
  
  <p>The question for example will be of the form "if segment size &lt; 1.5,then choose left node, else right". The question can be a dictionary with a key and a value. The left and right node represent a complete left or right half tree, which will be traversed recursively until the leaf node is reached. In this manner we will build a binary decision tree.</p>