<p>In <a href="https://github.com/mlpack/mlpack/pull/699#discussion_r69015102">src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp</a>:</p>
<pre style='color:#555'>> + template<typename> class SweepType>
> +template<typename TreeType>
> +void RPlusTreeSplit<SplitPolicyType, SweepType>::
> +AddFakeNodes(const TreeType* tree, TreeType* emptyTree)
> +{
> + size_t numDescendantNodes = tree->TreeDepth() - 1;
> +
> + TreeType* node = emptyTree;
> + for (size_t i = 0; i < numDescendantNodes; i++)
> + {
> + TreeType* child = new TreeType(node);
> + node->children[node->NumChildren()++] = child;
> +
> + node = child;
> + }
> +}
</pre>
<p>Just to be sure I am understanding correctly, this function is used to make sure that the tree has equivalent maximum depth in every branch?</p>
<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">—<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/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69015102">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe/AJ4bFFSPu_VAJHhLZElmbhMoQiwszSs3ks5qQsz2gaJpZM4I3ATw">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFInbbVKFt2H4BO2SCWT2gVR2GlEFks5qQsz2gaJpZM4I3ATw.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/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69015102"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>