diff --git a/src/Microsoft.ML.FastTree/RegressionTree.cs b/src/Microsoft.ML.FastTree/RegressionTree.cs
index cb0d9d011c..867d6015ef 100644
--- a/src/Microsoft.ML.FastTree/RegressionTree.cs
+++ b/src/Microsoft.ML.FastTree/RegressionTree.cs
@@ -56,7 +56,9 @@ public abstract class RegressionTreeBase
/// Note that the case (1) happens only when [i] is true and otherwise (2)
/// occurs. A non-negative returned value means a node (i.e., not a leaf); for example, 2 means the 3rd node in
/// the underlying . A negative returned value means a leaf; for example, -1 stands for the
- /// first leaf in the underlying .
+ /// (-1)-th leaf in the underlying . Note that is the
+ /// bitwise complement operator in C#; for details, see
+ /// https://docs.microsoft.com/en-us/dotnet/csharp/language-reference/operators/bitwise-complement-operator.
///
public IReadOnlyList LteChild => _lteChild;
diff --git a/src/Microsoft.ML.FastTree/TreeEnsemble.cs b/src/Microsoft.ML.FastTree/TreeEnsemble.cs
index 0981d38836..58df4c01aa 100644
--- a/src/Microsoft.ML.FastTree/TreeEnsemble.cs
+++ b/src/Microsoft.ML.FastTree/TreeEnsemble.cs
@@ -29,7 +29,7 @@ public abstract class TreeEnsemble where T : RegressionTreeBase
///
public IReadOnlyList Trees { get; }
- internal TreeEnsemble(IEnumerable trees, IEnumerable treeWeights, double bias)
+ private protected TreeEnsemble(IEnumerable trees, IEnumerable treeWeights, double bias)
{
Bias = bias;
TreeWeights = treeWeights.ToList();