Fixed SelfBalancingBinaryTree (codezonediitj#238)

* Fixed SelfBalancingBinaryTree._left_rotate and SelfBalancingBinaryTree._right_rotate

Author: Aimaanhasan

pydatastructs/trees/binary_trees.py

@@ -564,7 +564,10 @@ def _right_rotate(self, j, k):
         self.tree[j].left = y
         self.tree[k].parent = self.tree[j].parent
         if self.tree[k].parent is not None:
-            self.tree[self.tree[k].parent].left = k
+            if self.tree[self.tree[k].parent].left == j:
+                self.tree[self.tree[k].parent].left = k
+            else:
+                self.tree[self.tree[k].parent].right = k
         self.tree[j].parent = k
         self.tree[k].right = j
         kp = self.tree[k].parent
@@ -618,7 +621,10 @@ def _left_rotate(self, j, k):
         self.tree[j].right = y
         self.tree[k].parent = self.tree[j].parent
         if self.tree[k].parent is not None:
-            self.tree[self.tree[k].parent].right = k
+            if self.tree[self.tree[k].parent].left == j:
+                self.tree[self.tree[k].parent].left = k
+            else:
+                self.tree[self.tree[k].parent].right = k
         self.tree[j].parent = k
         self.tree[k].left = j
         kp = self.tree[k].parent

pydatastructs/trees/tests/test_binary_trees.py

@@ -1,6 +1,6 @@
 from pydatastructs.trees.binary_trees import (
     BinarySearchTree, BinaryTreeTraversal, AVLTree,
-    ArrayForTrees, BinaryIndexedTree, SplayTree)
+    ArrayForTrees, BinaryIndexedTree, SelfBalancingBinaryTree, SplayTree)
 from pydatastructs.utils.raises_util import raises
 from pydatastructs.utils.misc_util import TreeNode
 from copy import deepcopy
@@ -320,6 +320,7 @@ def test_BinaryIndexedTree():
     assert t.get_sum(0, 4) == 114
     assert t.get_sum(1, 9) == 54
 
+<<<<<<< HEAD
 def test_SplayTree():
     t = SplayTree(100, 100)
     t.insert(50, 50)
@@ -345,3 +346,33 @@ def test_SplayTree():
 
     assert str(s) == ("[(1, 2000, 2000, None), (None, 1000, 1000, None)]")
     assert str(t) == ("[(None, 100, 100, None), '', (6, 200, 200, None), (4, 50, 50, None), (5, 30, 30, None), (None, 20, 20, None), (3, 55, 55, 0), '', '']")
+=======
+def test_issue_234():
+    """
+    https://github.com/codezonediitj/pydatastructs/issues/234
+    """
+    tree = SelfBalancingBinaryTree()
+    tree.insert(5, 5)
+    tree.insert(5.5, 5.5)
+    tree.insert(4.5, 4.5)
+    tree.insert(4.6, 4.6)
+    tree.insert(4.4, 4.4)
+    tree.insert(4.55, 4.55)
+    tree.insert(4.65, 4.65)
+    original_tree = str(tree)
+    tree._right_rotate(3, 5)
+    assert tree.tree[3].parent == 5
+    assert tree.tree[2].right != 3
+    assert tree.tree[tree.tree[5].parent].right == 5
+    assert str(tree) == ("[(2, 5, 5, 1), (None, 5.5, 5.5, None), "
+                         "(4, 4.5, 4.5, 5), (None, 4.6, 4.6, 6), "
+                         "(None, 4.4, 4.4, None), (None, 4.55, 4.55, 3), "
+                         "(None, 4.65, 4.65, None)]")
+    assert tree.tree[tree.tree[3].parent].right == 3
+    tree._left_rotate(5, 3)
+    assert str(tree) == original_tree
+    tree.insert(4.54, 4.54)
+    tree.insert(4.56, 4.56)
+    tree._left_rotate(5, 8)
+    assert tree.tree[tree.tree[8].parent].left == 8
+>>>>>>> Fixed SelfBalancingBinaryTree (#238)