refactor optimizations for B tree & avl tree

Author: justcoding121

Advanced.Algorithms.Tests/DataStructures/Tree/BST_Tests.cs

@@ -17,40 +17,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);
 
             //delete
             tree.Delete(43);
@@ -65,7 +65,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);

Advanced.Algorithms/DataStructures/Tree/AvlTree.cs

@@ -76,7 +76,6 @@ private void insert(AVLTreeNode<T> node, T value)
 
             var compareResult = node.Value.CompareTo(value);
 
-
             //node is less than the value so move right for insertion
             if (compareResult < 0)
             {
@@ -108,7 +107,6 @@ private void insert(AVLTreeNode<T> node, T value)
             }
 
             UpdateHeight(node);
-
             balance(node);
 
         }
@@ -260,7 +258,7 @@ private void delete(AVLTreeNode<T> node, T value)
 
         }
 
-        public T findMax()
+        public T FindMax()
         {
             return findMax(Root).Value;
         }