diff --git a/Orthtree/include/CGAL/Orthtree.h b/Orthtree/include/CGAL/Orthtree.h
index fef35cc7c32..1b7b489e4dd 100644
--- a/Orthtree/include/CGAL/Orthtree.h
+++ b/Orthtree/include/CGAL/Orthtree.h
@@ -640,7 +640,7 @@ public:
     std::size_t i = 0;
     for (const FT& f : cartesian_range(m_bbox_min))
     {
-      bary[i] = node.global_coordinates()[i] * size + (size / 2.0) + f;
+      bary[i] = FT(node.global_coordinates()[i]) * size + size / 2.0 + f;
       ++ i;
     }
 
diff --git a/Orthtree/include/CGAL/Orthtree/Split_predicates.h b/Orthtree/include/CGAL/Orthtree/Split_predicates.h
index 35d710bdaff..926a26c94de 100644
--- a/Orthtree/include/CGAL/Orthtree/Split_predicates.h
+++ b/Orthtree/include/CGAL/Orthtree/Split_predicates.h
@@ -102,7 +102,7 @@ public:
   /*!
     \brief returns `true` if `n` should be split, `false` otherwise.
    */
-  template<template Node>
+  template<typename Node>
   bool operator()(const Node &n) const {
     size_t num_points = n.size();
     size_t depth = n.depth();