rename bst inital collection param

Author: justcoding121

src/Advanced.Algorithms/DataStructures/Tree/AvlTree.cs

@@ -30,14 +30,14 @@ public AVLTree(bool enableNodeLookUp = false)
         /// Initialize the BST with given sorted keys.
         /// Time complexity: O(n).
         /// </summary>
-        /// <param name="sortedKeys">The sorted keys.</param>
+        /// <param name="sortedCollection">The initial sorted collection.</param>
         /// <param name="enableNodeLookUp">Enabling lookup will fasten deletion/insertion/exists operations
         ///  at the cost of additional space.</param>
-        public AVLTree(IEnumerable<T> sortedKeys, bool enableNodeLookUp = false)
+        public AVLTree(IEnumerable<T> sortedCollection, bool enableNodeLookUp = false)
             : this(enableNodeLookUp)
         {
-            ValidateCollection(sortedKeys);
-            var nodes = sortedKeys.Select(x => new AVLTreeNode<T>(null, x)).ToArray();
+            ValidateSortedCollection(sortedCollection);
+            var nodes = sortedCollection.Select(x => new AVLTreeNode<T>(null, x)).ToArray();
             Root = (AVLTreeNode<T>)ToBST(nodes);
             recomputeHeight(Root);
             assignCount(Root);

src/Advanced.Algorithms/DataStructures/Tree/BST.cs

@@ -20,10 +20,10 @@ public BST() { }
         /// Initialize the BST with given sorted keys.
         /// Time complexity: O(n).
         /// </summary>
-        public BST(IEnumerable<T> sortedKeys) : this()
+        public BST(IEnumerable<T> sortedCollection) : this()
         {
-            ValidateCollection(sortedKeys);
-            var nodes = sortedKeys.Select(x => new BSTNode<T>(null, x)).ToArray();
+            ValidateSortedCollection(sortedCollection);
+            var nodes = sortedCollection.Select(x => new BSTNode<T>(null, x)).ToArray();
             Root = (BSTNode<T>)ToBST(nodes);
             assignCount(Root);
         }

src/Advanced.Algorithms/DataStructures/Tree/RedBlackTree.cs

@@ -21,16 +21,13 @@ public class RedBlackTree<T> : BSTBase<T>, IEnumerable<T> where T : IComparable
         /// Initialize the BST with given sorted keys optionally.
         /// Time complexity: O(n).
         /// </summary>
-        /// <param name="collection">The sorted keys.</param>
-        /// <param name="enableNodeLookUp">Enabling lookup will fasten deletion/insertion/exists operations
-        /// at the cost of additional space.</param>
-        /// <param name="equalityComparer">Provide custom IEquality comparer for node lookup dictionary when enabled.</param>
-        public RedBlackTree(IEnumerable<T> sortedKeys = null)
+        /// <param name="sortedCollection">The sorted initial collection.</param>
+        public RedBlackTree(IEnumerable<T> sortedCollection = null)
         {
-            if (sortedKeys != null)
+            if (sortedCollection != null)
             {
-                ValidateCollection(sortedKeys);
-                var nodes = sortedKeys.Select(x => new RedBlackTreeNode<T>(null, x)).ToArray();
+                ValidateSortedCollection(sortedCollection);
+                var nodes = sortedCollection.Select(x => new RedBlackTreeNode<T>(null, x)).ToArray();
                 Root = (RedBlackTreeNode<T>)ToBST(nodes);
                 assignColors(Root);
                 assignCount(Root);

src/Advanced.Algorithms/DataStructures/Tree/Shared/BSTBase.cs

@@ -5,9 +5,9 @@ namespace Advanced.Algorithms.DataStructures
 {
     public class BSTBase<T> where T : IComparable
     {
-        internal void ValidateCollection(IEnumerable<T> collection)
+        internal void ValidateSortedCollection(IEnumerable<T> sortedCollection)
         {
-            if (!isSorted(collection))
+            if (!isSorted(sortedCollection))
             {
                 throw new ArgumentException("Initial collection should have unique keys and be in sorted order.");
             }

src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs

@@ -18,11 +18,11 @@ public SplayTree() { }
         /// Initialize the BST with given sorted keys.
         /// Time complexity: O(n).
         /// </summary>
-        /// <param name="sortedKeys">The sorted keys.</param>
-        public SplayTree(IEnumerable<T> collection) : this()
+        /// <param name="sortedCollection">The sorted collection.</param>
+        public SplayTree(IEnumerable<T> sortedCollection) : this()
         {
-            ValidateCollection(collection);
-            var nodes = collection.Select(x => new SplayTreeNode<T>(null, x)).ToArray();
+            ValidateSortedCollection(sortedCollection);
+            var nodes = sortedCollection.Select(x => new SplayTreeNode<T>(null, x)).ToArray();
             Root = (SplayTreeNode<T>)ToBST(nodes);
             assignCount(Root);
         }

src/Advanced.Algorithms/DataStructures/Tree/TreapTree.cs

@@ -20,11 +20,11 @@ public TreapTree() { }
         /// Initialize the BST with given sorted keys.
         /// Time complexity: O(n).
         /// </summary>
-        /// <param name="sortedKeys">The sorted keys.</param>
-        public TreapTree(IEnumerable<T> collection) : this()
+        /// <param name="sortedCollection">The initial sorted collection.</param>
+        public TreapTree(IEnumerable<T> sortedCollection) : this()
         {
-            ValidateCollection(collection);
-            var nodes = collection.Select(x => new TreapTreeNode<T>(null, x, rndGenerator.Next())).ToArray();
+            ValidateSortedCollection(sortedCollection);
+            var nodes = sortedCollection.Select(x => new TreapTreeNode<T>(null, x, rndGenerator.Next())).ToArray();
             Root = (TreapTreeNode<T>)ToBST(nodes);
             assignCount(Root);
             heapify(Root);