note

justcoding121 · justcoding121 · commit 0e0ea1964bac · 2018-11-09T12:36:37.000-05:00
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/B+Tree.cs b/src/Advanced.Algorithms/DataStructures/Tree/B+Tree.cs
@@ -14,7 +14,7 @@ public class BpTree<T> : IEnumerable<T> where T : IComparable
         internal BpTreeNode<T> Root;
 
         /// <summary>
-        /// Keep a reference of Bottom Left Node
+        /// Keep a reference of Bottom Left/Right Node
         /// for fast ascending/descending enumeration using Next pointer.
         /// See IEnumerable & IEnumerableDesc implementation at bottom.
         /// </summary>
