<p>In <a href="https://github.com/mlpack/mlpack/pull/762#discussion_r75571196">src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp</a>:</p>
<pre style='color:#555'>&gt; +  template&lt;typename VecType&gt;
&gt; +  BinarySpaceTree&amp; GetFurthestChild(
&gt; +      const VecType&amp; point,
&gt; +      typename boost::enable_if&lt;IsVector&lt;VecType&gt; &gt;::type* = 0);
&gt; +
&gt; +  /**
&gt; +   * Return the nearest child node to the given query node.  If it can&#39;t decide
&gt; +   * it will return a null pointer.
&gt; +   */
&gt; +  BinarySpaceTree* GetNearestChild(const BinarySpaceTree&amp; queryNode);
&gt; +
&gt; +  /**
&gt; +   * Return the furthest child node to the given query node.  If it can&#39;t decide
&gt; +   * it will return a null pointer.
&gt; +   */
&gt; +  BinarySpaceTree* GetFurthestChild(const BinarySpaceTree&amp; queryNode);
</pre>
<p><a href="https://github.com/rcurtin" class="user-mention">@rcurtin</a>  The overloads of spill trees are used for <code>DefeatistDualTreeTraverser</code>. Also, all of these overloads will be used when implementing a greedy dual tree traverser.<br>
I agree that it is best to return an index. I have updated the code in: <a href="https://github.com/mlpack/mlpack/pull/762/commits/8e305125edbc85f6f037fbb01b081509153641ff" class="commit-link"><tt>8e30512</tt></a><br>
Thanks!</p>

<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">&mdash;<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly, <a href="https://github.com/mlpack/mlpack/pull/762/files/f8ddd58ece06362024944a6533f68074a6b27ef7#r75571196">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFPAjuRM1PBNrZa2HShx3O-M3Yy2Vks5qhmWtgaJpZM4JlKcS">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFI_DQZvpcc009awEuhyBH7l54pJPks5qhmWtgaJpZM4JlKcS.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/pull/762/files/f8ddd58ece06362024944a6533f68074a6b27ef7#r75571196"></link>
  <meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>

<script type="application/json" data-scope="inboxmarkup">{"api_version":"1.0","publisher":{"api_key":"05dde50f1d1a384dd78767c55493e4bb","name":"GitHub"},"entity":{"external_key":"github/mlpack/mlpack","title":"mlpack/mlpack","subtitle":"GitHub repository","main_image_url":"https://cloud.githubusercontent.com/assets/143418/17495839/a5054eac-5d88-11e6-95fc-7290892c7bb5.png","avatar_image_url":"https://cloud.githubusercontent.com/assets/143418/15842166/7c72db34-2c0b-11e6-9aed-b52498112777.png","action":{"name":"Open in GitHub","url":"https://github.com/mlpack/mlpack"}},"updates":{"snippets":[{"icon":"PERSON","message":"@MarcosPividori in #762: @rcurtin  The overloads of spill trees are used for `DefeatistDualTreeTraverser`. Also, all of these overloads will be used when implementing a greedy dual tree traverser.\r\nI agree that it is best to return an index. I have updated the code in: https://github.com/mlpack/mlpack/pull/762/commits/8e305125edbc85f6f037fbb01b081509153641ff\r\nThanks!"}],"action":{"name":"View Pull Request","url":"https://github.com/mlpack/mlpack/pull/762/files/f8ddd58ece06362024944a6533f68074a6b27ef7#r75571196"}}}</script>