cleanup

justcoding121 · justcoding121 · commit 28913fab31e8 · 2019-01-21T13:22:35.000-05:00
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/RedBlackTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/RedBlackTree.cs
@@ -10,7 +10,7 @@ namespace Advanced.Algorithms.DataStructures
     /// </summary>
     public class RedBlackTree<T> : IEnumerable<T> where T : IComparable
     {
-        //only used internally by Bentley-Ottmann sweepline algorithm for faster line swap operation.
+        //if enabled, lookup will fasten deletion/insertion/exists operations. 
         private readonly Dictionary<T, BSTNodeBase<T>> nodeLookUp;
 
         internal RedBlackTreeNode<T> Root { get; set; }

Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ namespace Advanced.Algorithms.DataStructures`
`10`	`10`	`/// </summary>`
`11`	`11`	`public class RedBlackTree<T> : IEnumerable<T> where T : IComparable`
`12`	`12`	`{`
`13`		`- //only used internally by Bentley-Ottmann sweepline algorithm for faster line swap operation.`
	`13`	`+ //if enabled, lookup will fasten deletion/insertion/exists operations.`
`14`	`14`	`private readonly Dictionary<T, BSTNodeBase<T>> nodeLookUp;`
`15`	`15`
`16`	`16`	`internal RedBlackTreeNode<T> Root { get; set; }`