Apply suggestions from code review

Author: czgdp1807

pydatastructs/trees/binary_trees.py

@@ -1058,32 +1058,33 @@ def get_sum(self, left_index, right_index):
 class SplayTree(SelfBalancingBinaryTree):
     """
     Represents Splay Trees.
+
     References
     ==========
-    [1] https://en.wikipedia.org/wiki/Splay_tree
+    .. [1] https://en.wikipedia.org/wiki/Splay_tree
 
     """
-    def _zig(self,x,p):
+    def _zig(self, x, p):
         if self.tree[p].left == x:
             super(SplayTree, self)._right_rotate(p, x)
         else:
             super(SplayTree, self)._left_rotate(p, x)
 
-    def _zig_zig(self,x,p):
+    def _zig_zig(self, x, p):
         super(SplayTree, self)._right_rotate(self.tree[p].parent, p)
         super(SplayTree, self)._right_rotate(p, x)
 
-    def _zig_zag(self,x,p):
+    def _zig_zag(self, x, p):
         super(SplayTree, self)._left_right_rotate(self.tree[p].parent, p)
 
-    def _zag_zag(self,x,p):
+    def _zag_zag(self, x, p):
         super(SplayTree, self)._left_rotate(self.tree[p].parent, p)
         super(SplayTree, self)._left_rotate(p, x)
 
-    def _zag_zig(self,x,p):
+    def _zag_zig(self, x, p):
         super(SplayTree, self)._right_left_rotate(self.tree[p].parent, p)
 
-    def splay(self,x,p):
+    def splay(self, x, p):
         while self.tree[x].parent is not None:
             if self.tree[p].parent is None:
                 self._zig(x, p)
@@ -1097,13 +1098,13 @@ def splay(self,x,p):
                 self._zig_zag(x, p)
             p = self.tree[x].parent
 
-    def insert(self,key,x):
+    def insert(self, key, x):
         super(SelfBalancingBinaryTree, self).insert(key, x)
         e, p = super(SelfBalancingBinaryTree, self).search(x, parent=True)
         self.tree[self.size-1].parent = p;
         self.splay(e, p)
 
-    def delete(self,x):
+    def delete(self, x):
         e, p = super(SelfBalancingBinaryTree, self).search(x, parent=True)
         if e is None:
             return