Made PEP8 compatible

Author: OmkarPathak

pygorithm/data_structures/tree.py

@@ -8,32 +8,33 @@ def __init__(self, data = None):
         self.right = None
         self.data = data
 
-    # for setting left node
     def set_left(self, node):
+        ''' for setting the left child of the node '''
         self.left = node
 
-    # for setting right node
     def set_right(self, node):
+        ''' for setting the right child of the node '''
         self.right = node
 
-    # for getting the left node
     def get_left(self):
+        ''' for getting the left child of the node '''
         return self.left
 
-    # for getting right node
     def get_right(self):
+        ''' for getting the right child of the node '''
         return self.right
 
-    # for setting data of a node
     def set_data(self, data):
+        ''' for setting the data of the node '''
         self.data = data
 
-    # for getting data of a node
     def get_data(self):
+        ''' for getting the data of the node '''
         return self.data
 
     # easily retrieve the source code of the Node class
     def get_code(self):
+        ''' returns the code of the current class '''
         import inspect
         return inspect.getsource(Node)
 
@@ -79,6 +80,7 @@ def postorder(self, root):
 
     # easily retrieve the source code of the BinaryTree class
     def get_code(self):
+        ''' returns the code of the current class '''
         import inspect
         return inspect.getsource(BinaryTree)
 
@@ -91,35 +93,32 @@ def __init__(self, data):
         self._preorder = []
         self._postorder = []
 
-    # for setting left node
     def set_left(self, node):
+        ''' for setting the left child of the node '''
         self.leftChild = node
 
-    # for setting right node
     def set_right(self, node):
+        ''' for setting the right child of the node '''
         self.rightChild = node
 
-    # for getting the left node
     def get_left(self):
+        ''' returns the left child of the current node '''
         return self.leftChild
 
-    # for getting right node
     def get_right(self):
+        ''' returns the right child of the current node '''
         return self.rightChild
 
     # for setting data of a node
     def set_data(self, data):
+        ''' for setting the data of a node '''
         self.data = data
 
     # for getting data of a node
     def get_data(self):
+        ''' returns the data of the current node '''
         return self.data
 
-    # easily retrieve the source code of the Node class
-    def get_code(self):
-        import inspect
-        return inspect.getsource(BSTNode)
-
     def insert(self, data):
         ''' For inserting the data in the Tree '''
         if self.data == data:
@@ -141,7 +140,7 @@ def insert(self, data):
                 self.rightChild = BSTNode(data)
                 return True
 
-    def minValueBSTNode(self, BSTNode):
+    def min_val_bst_node(self, BSTNode):
         current = BSTNode
 
         # loop down to find the leftmost leaf
@@ -173,7 +172,7 @@ def delete(self, data):
 
             # deleting BSTNode with two children
             # first get the inorder successor
-            temp = self.minValueBSTNode(self.rightChild)
+            temp = self.min_val_bst_node(self.rightChild)
             self.data = temp.data
             self.rightChild = self.rightChild.delete(temp.data)
 
@@ -228,6 +227,7 @@ def postorder(self, root):
 
     # easily retrieve the source code of the BSTNode class
     def get_code(self):
+        ''' returns the code of current class '''
         import inspect
         return inspect.getsource(BSTNode)
 
@@ -236,13 +236,15 @@ def __init__(self):
         self.root = None
 
     def insert(self, data):
+        ''' inserts a node in the tree '''
         if self.root:
             return self.root.insert(data)
         else:
             self.root = BSTNode(data)
             return True
 
     def delete(self, data):
+        ''' deletes the node with the specified data from the tree '''
         if self.root is not None:
             return self.root.delete(data)
 
@@ -253,20 +255,24 @@ def find(self, data):
             return False
 
     def preorder(self):
+        ''' finding the preorder of the tree '''
         if self.root is not None:
             return self.root.preorder(self.root)
 
     def inorder(self):
+        ''' finding the inorder of the tree '''
         print()
         if self.root is not None:
             return self.root.inorder(self.root)
 
     def postorder(self):
+        ''' finding the postorder of the tree '''
         print()
         if self.root is not None:
             return self.root.postorder(self.root)
 
     # easily retrieve the source code of the BinarySearchTree class
     def get_code(self):
+        ''' returns the code of the current class '''
         import inspect
         return inspect.getsource(BinarySearchTree)