bst SetHeight to internal

justcoding121 · justcoding121 · commit 8a4ead94e9ae · 2018-11-05T11:31:12.000-05:00
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/AvlTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/AvlTree.cs
@@ -60,7 +60,7 @@ public bool HasItem(T value)
         /// <summary>
         /// Time complexity: O(log(n))
         /// </summary>
-        public int GetHeight()
+        internal int GetHeight()
         {
             if (Root == null)
                 return -1;
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/BST.cs b/src/Advanced.Algorithms/DataStructures/Tree/BST.cs
@@ -44,7 +44,7 @@ public bool HasItem(T value)
         /// <summary>
         /// Time complexity: O(n)
         /// </summary>
-        public int getHeight()
+        internal int GetHeight()
         {
             return getHeight(Root);
         }
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs
@@ -43,7 +43,7 @@ public bool HasItem(T value)
         /// <summary>
         ///  Time complexity: O(n)
         /// </summary>
-        public int GetHeight()
+        internal int GetHeight()
         {
             return GetHeight(Root);
         }
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/TreapTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/TreapTree.cs
@@ -45,7 +45,7 @@ public bool HasItem(T value)
         /// <summary>
         /// Time complexity: O(log(n))
         /// </summary>
-        public int GetHeight()
+        internal int GetHeight()
         {
             return getHeight(Root);
         }
diff --git a/tests/Advanced.Algorithms.Tests/DataStructures/Tree/BST_Tests.cs b/tests/Advanced.Algorithms.Tests/DataStructures/Tree/BST_Tests.cs
@@ -16,40 +16,40 @@ public void BST_Test()
         {
             //insert test
             var tree = new BST<int>();
-            Assert.AreEqual(tree.getHeight(), -1);
+            Assert.AreEqual(tree.GetHeight(), -1);
 
             tree.Insert(11);
-            Assert.AreEqual(tree.getHeight(), 0);
+            Assert.AreEqual(tree.GetHeight(), 0);
 
             tree.Insert(6);
-            Assert.AreEqual(tree.getHeight(), 1);
+            Assert.AreEqual(tree.GetHeight(), 1);
 
             tree.Insert(8);
-            Assert.AreEqual(tree.getHeight(), 2);
+            Assert.AreEqual(tree.GetHeight(), 2);
 
             tree.Insert(19);
-            Assert.AreEqual(tree.getHeight(), 2);
+            Assert.AreEqual(tree.GetHeight(), 2);
 
             tree.Insert(4);
-            Assert.AreEqual(tree.getHeight(), 2);
+            Assert.AreEqual(tree.GetHeight(), 2);
 
             tree.Insert(10);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             tree.Insert(5);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             tree.Insert(17);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             tree.Insert(43);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             tree.Insert(49);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             tree.Insert(31);
-            Assert.AreEqual(tree.getHeight(), 3);
+            Assert.AreEqual(tree.GetHeight(), 3);
 
             Assert.IsTrue(tree.Root.IsBinarySearchTree(int.MinValue, int.MaxValue));
 
@@ -69,7 +69,7 @@ public void BST_Test()
             tree.Delete(49);
             tree.Delete(31);
 
-            Assert.AreEqual(tree.getHeight(), -1);
+            Assert.AreEqual(tree.GetHeight(), -1);
             Assert.AreEqual(tree.Count, 0);
 
             tree.Insert(31);

Original file line number	Diff line number	Diff line change
`@@ -60,7 +60,7 @@ public bool HasItem(T value)`
`60`	`60`	`/// <summary>`
`61`	`61`	`/// Time complexity: O(log(n))`
`62`	`62`	`/// </summary>`
`63`		`- public int GetHeight()`
	`63`	`+ internal int GetHeight()`
`64`	`64`	`{`
`65`	`65`	`if (Root == null)`
`66`	`66`	`return -1;`
Original file line number	Diff line number	Diff line change
`@@ -44,7 +44,7 @@ public bool HasItem(T value)`
`44`	`44`	`/// <summary>`
`45`	`45`	`/// Time complexity: O(n)`
`46`	`46`	`/// </summary>`
`47`		`- public int getHeight()`
	`47`	`+ internal int GetHeight()`
`48`	`48`	`{`
`49`	`49`	`return getHeight(Root);`
`50`	`50`	`}`
Original file line number	Diff line number	Diff line change
`@@ -43,7 +43,7 @@ public bool HasItem(T value)`
`43`	`43`	`/// <summary>`
`44`	`44`	`/// Time complexity: O(n)`
`45`	`45`	`/// </summary>`
`46`		`- public int GetHeight()`
	`46`	`+ internal int GetHeight()`
`47`	`47`	`{`
`48`	`48`	`return GetHeight(Root);`
`49`	`49`	`}`
Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ public bool HasItem(T value)`
`45`	`45`	`/// <summary>`
`46`	`46`	`/// Time complexity: O(log(n))`
`47`	`47`	`/// </summary>`
`48`		`- public int GetHeight()`
	`48`	`+ internal int GetHeight()`
`49`	`49`	`{`
`50`	`50`	`return getHeight(Root);`
`51`	`51`	`}`