diff --git a/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp b/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
index e54ae1a638..ff3b2ef8d4 100644
--- a/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
@@ -101,8 +101,6 @@ class RectangleTree
   SplitHistoryStruct splitHistory;
   //! The distance from the centroid of this node to the centroid of the parent.
   double parentDistance;
-  //! The discance to the furthest descendant, cached to speed things up.
-  double furthestDescendantDistance;
   //! The dataset.
   const MatType* dataset;
   //! Whether or not we are responsible for deleting the dataset.  This is
diff --git a/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp b/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
index 4a44435721..8c2520c1a0 100644
--- a/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
@@ -540,7 +540,7 @@ template<typename MetricType,
 inline size_t RectangleTree<MetricType, StatisticType, MatType, SplitType,
                             DescentType>::NumDescendants() const
 {
-  std::cout << "NumDescendants() [" << this << "], with " << numChildren 
+  std::cout << "NumDescendants() [" << this << "], with " << numChildren
       << "children.\n";
   if (numChildren == 0)
   {
@@ -638,7 +638,6 @@ RectangleTree() :
     minLeafSize(0),
     splitHistory(0),
     parentDistance(0.0),
-    furthestDescendantDistance(0.0),
     dataset(NULL),
     ownsDataset(false),
     localDataset(NULL)
@@ -976,7 +975,6 @@ void RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType>::
   ar & CreateNVP(stat, "stat");
   ar & CreateNVP(splitHistory, "splitHistory");
   ar & CreateNVP(parentDistance, "parentDistance");
-  ar & CreateNVP(furthestDescendantDistance, "furthestDescendantDistance");
   ar & CreateNVP(dataset, "dataset");
 
   // If we are loading and we are the root, we own the dataset.