diff --git a/gtsam/linear/GaussianMultifrontalSolver.cpp b/gtsam/linear/GaussianMultifrontalSolver.cpp
index 9e80b7c29..d849f71ed 100644
--- a/gtsam/linear/GaussianMultifrontalSolver.cpp
+++ b/gtsam/linear/GaussianMultifrontalSolver.cpp
@@ -44,7 +44,7 @@ void GaussianMultifrontalSolver::replaceFactors(const FactorGraph<GaussianFactor
 }
 
 /* ************************************************************************* */
-BayesTree<GaussianConditional>::shared_ptr GaussianMultifrontalSolver::eliminate() const {
+GaussianBayesTree::shared_ptr GaussianMultifrontalSolver::eliminate() const {
 	if (useQR_)
 		return Base::eliminate(&EliminateQR);
 	else
diff --git a/gtsam/linear/GaussianMultifrontalSolver.h b/gtsam/linear/GaussianMultifrontalSolver.h
index 71a4c0c20..8177bed0b 100644
--- a/gtsam/linear/GaussianMultifrontalSolver.h
+++ b/gtsam/linear/GaussianMultifrontalSolver.h
@@ -18,6 +18,7 @@
 #pragma once
 
 #include <gtsam/inference/GenericMultifrontalSolver.h>
+#include <gtsam/linear/GaussianBayesTree.h>
 #include <gtsam/linear/GaussianJunctionTree.h>
 #include <gtsam/linear/VectorValues.h>
 
@@ -86,7 +87,7 @@ public:
    * Eliminate the factor graph sequentially.  Uses a column elimination tree
    * to recursively eliminate.
    */
-  BayesTree<GaussianConditional>::shared_ptr eliminate() const;
+  GaussianBayesTree::shared_ptr eliminate() const;
 
   /**
    * Compute the least-squares solution of the GaussianFactorGraph.  This