Update AVLTreeRecursive.java

williamfiset · web-flow · commit 028d6beca3ad · 2020-06-04T21:08:49.000-07:00
diff --git a/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java b/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java
@@ -76,7 +76,6 @@ public boolean contains(T value) {
 
   // Recursive contains helper method.
   private boolean contains(Node node, T value) {
-
     if (node == null) return false;
 
     // Compare current value to the value in the node.
@@ -105,7 +104,6 @@ public boolean insert(T value) {
 
   // Inserts a value inside the AVL tree.
   private Node insert(Node node, T value) {
-
     // Base case.
     if (node == null) return new Node(value);
 
@@ -115,7 +113,6 @@ private Node insert(Node node, T value) {
     // Insert node in left subtree.
     if (cmp < 0) {
       node.left = insert(node.left, value);
-      ;
 
       // Insert node in right subtree.
     } else {
@@ -131,7 +128,6 @@ private Node insert(Node node, T value) {
 
   // Update a node's height and balance factor.
   private void update(Node node) {
-
     int leftNodeHeight = (node.left == null) ? -1 : node.left.height;
     int rightNodeHeight = (node.right == null) ? -1 : node.right.height;
 
@@ -144,7 +140,6 @@ private void update(Node node) {
 
   // Re-balance a node if its balance factor is +2 or -2.
   private Node balance(Node node) {
-
     // Left heavy subtree.
     if (node.bf == -2) {
 
@@ -212,7 +207,6 @@ private Node rightRotation(Node node) {
 
   // Remove a value from this binary tree if it exists, O(log(n))
   public boolean remove(T elem) {
-
     if (elem == null) return false;
 
     if (contains(root, elem)) {
@@ -226,7 +220,6 @@ public boolean remove(T elem) {
 
   // Removes a value from the AVL tree.
   private Node remove(Node node, T elem) {
-
     if (node == null) return null;
 
     int cmp = elem.compareTo(node.value);
