diff --git a/src/mlpack/core/tree/greedy_single_tree_traverser.hpp b/src/mlpack/core/tree/greedy_single_tree_traverser.hpp
index a819e4b288..33034c3c0a 100644
--- a/src/mlpack/core/tree/greedy_single_tree_traverser.hpp
+++ b/src/mlpack/core/tree/greedy_single_tree_traverser.hpp
@@ -41,7 +41,10 @@ class GreedySingleTreeTraverser
   size_t NumPrunes() const { return numPrunes; }
 
   //! Set value of minBaseCases.
-  void MinBaseCases(size_t baseCases) { minBaseCases = baseCases; }
+  size_t& MinBaseCases() { return minBaseCases; }
+
+  //! Get value of minBaseCases.
+  size_t MinBaseCases() const { return minBaseCases; }
 
  private:
   //! Reference to the rules with which the tree will be traversed.
diff --git a/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp b/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
index af925f76de..4cf1a68d4f 100644
--- a/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
+++ b/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
@@ -663,7 +663,7 @@ DualTreeTraversalType, SingleTreeTraversalType>::Search(
       tree::GreedySingleTreeTraverser<Tree, RuleType> traverser(rules);
 
       // Set the value of minBaseCases.
-      traverser.MinBaseCases(k);
+      traverser.MinBaseCases() = k;
 
       // Now have it traverse for each point.
       for (size_t i = 0; i < querySet.n_cols; ++i)
@@ -963,7 +963,7 @@ DualTreeTraversalType, SingleTreeTraversalType>::Search(
       tree::GreedySingleTreeTraverser<Tree, RuleType> traverser(rules);
 
       // Set the value of minBaseCases.
-      traverser.MinBaseCases(k);
+      traverser.MinBaseCases() = k;
 
       // Now have it traverse for each point.
       for (size_t i = 0; i < referenceSet->n_cols; ++i)