comments

Author: justcoding121

Advanced.Algorithms/DataStructures/Tree/AvlTree.cs

@@ -122,7 +122,7 @@ private void insert(AVLTreeNode<T> node, T value)
 
 
         /// <summary>
-        /// Time complexity: O(log(n))
+        /// Time complexity: O(log(n)).
         /// </summary>
         public void Delete(T value)
         {
@@ -280,7 +280,7 @@ private void delete(AVLTreeNode<T> node, T value)
         }
 
         /// <summary>
-        /// Time complexity: O(log(n))
+        /// Time complexity: O(log(n)).
         /// </summary>
         public T FindMax()
         {
@@ -302,7 +302,7 @@ private AVLTreeNode<T> findMax(AVLTreeNode<T> node)
         }
 
         /// <summary>
-        /// Time complexity: O(log(n))
+        /// Time complexity: O(log(n)).
         /// </summary>
         public T FindMin()
         {
@@ -323,7 +323,7 @@ private AVLTreeNode<T> findMin(AVLTreeNode<T> node)
         }
 
         /// <summary>
-        /// Time complexity: O(log(n))
+        /// Time complexity: O(log(n)).
         /// </summary>
         public bool Contains(T value)
         {
@@ -536,7 +536,7 @@ private void UpdateHeight(AVLTreeNode<T> node)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next lower value to given value in this BST.
         ///     Time complexity: O(log(n))
         /// </summary>
         public T NextLower(T value)
@@ -552,7 +552,7 @@ public T NextLower(T value)
         }
 
         /// <summary>
-        ///     Get the value next to given value in this BST.
+        ///     Get the next higher value to given value in this BST.
         ///     Time complexity: O(log(n))
         /// </summary>
         public T NextHigher(T value)

Advanced.Algorithms/DataStructures/Tree/BST.cs

@@ -360,7 +360,7 @@ private BSTNodeBase<T> find(T value)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next lower value to given value in this BST.
         ///     Time complexity: O(n)
         /// </summary>
         public T NextLower(T value)
@@ -376,7 +376,7 @@ public T NextLower(T value)
         }
 
         /// <summary>
-        ///     Get the value next to given value in this BST.
+        ///     Get the next higher value to given value in this BST.
         ///     Time complexity: O(n)
         /// </summary>
         public T NextHigher(T value)

Advanced.Algorithms/DataStructures/Tree/RedBlackTree.cs

@@ -74,11 +74,6 @@ private RedBlackTreeNode<T> findMax(RedBlackTreeNode<T> node)
             return node.FindMax() as RedBlackTreeNode<T>;
         }
 
-        private RedBlackTreeNode<T> findMin(RedBlackTreeNode<T> node)
-        {
-            return node.FindMin() as RedBlackTreeNode<T>;
-        }
-
         /// <summary>
         ///  Time complexity: O(log(n))
         /// </summary>
@@ -702,7 +697,7 @@ private RedBlackTreeNode<T> handleDoubleBlack(RedBlackTreeNode<T> node)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next lower value to given value in this BST.
         /// </summary>
         public T NextLower(T value)
         {
@@ -717,7 +712,7 @@ public T NextLower(T value)
         }
 
         /// <summary>
-        ///     Get the value next to given value in this BST.
+        ///     Get the next higher to given value in this BST.
         /// </summary>
         public T NextHigher(T value)
         {

Advanced.Algorithms/DataStructures/Tree/SplayTree.cs

@@ -438,7 +438,7 @@ private BSTNodeBase<T> find(T value)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next lower value to given value in this BST.
         ///     Time complexity: O(n).
         /// </summary>
         public T NextLower(T value)
@@ -454,7 +454,7 @@ public T NextLower(T value)
         }
 
         /// <summary>
-        ///     Get the value next to given value in this BST.
+        ///     Get the next higher value to given value in this BST.
         ///     Time complexity: O(n).
         /// </summary>
         public T NextHigher(T value)

Advanced.Algorithms/DataStructures/Tree/TreapTree.cs

@@ -430,7 +430,7 @@ private BSTNodeBase<T> find(T value)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next lower value to given value in this BST.
         ///     Time complexity: O(n).
         /// </summary>
         public T NextLower(T value)
@@ -446,7 +446,7 @@ public T NextLower(T value)
         }
 
         /// <summary>
-        ///     Get the value previous to given value in this BST.
+        ///     Get the next higher value to given value in this BST.
         ///     Time complexity: O(n).
         /// </summary>
         public T NextHigher(T value)