<p>Give me a couple days to write up the exact algorithm I'm thinking of in a tree-independent way, and then when you implement it you'll only need to implement a <code>BaseCase()</code> and <code>Score()</code> function, and you won't need to worry about implementing the tree itself or the way that the tree is traversed.</p>

<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">&mdash;<br>Reply to this email directly or <a href="https://github.com/mlpack/mlpack/issues/215#issuecomment-75355864">view it on GitHub</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFO8O22OGUowWfuUo8gxDIsQ9r584ks5nuAYZgaJpZM4DM19F.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
  <div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
    <link itemprop="url" href="https://github.com/mlpack/mlpack/issues/215#issuecomment-75355864"></link>
    <meta itemprop="name" content="View Issue"></meta>
  </div>
  <meta itemprop="description" content="View this Issue on GitHub"></meta>
</div>