Forget camel case

BST.py

@@ -46,9 +46,9 @@ class BST:
                 parent.left = to_add
             self.size += 1
 
-    def inOrder(self):
+    def in_order(self):
         ret = []
-        inOrderRec(self.root, ret)
+        in_order_rec(self.root, ret)
         return ret
 
     @classmethod
@@ -61,14 +61,14 @@ class BST:
         return self.root.height()
 
 
-def inOrderRec(top, ret):
+def in_order_rec(top, ret):
     if top is None:
         return
     if top.left:
-        inOrderRec(top.left, ret)
+        in_order_rec(top.left, ret)
     ret.append(top)
     if top.right:
-        inOrderRec(top.right, ret)
+        in_order_rec(top.right, ret)
 
 
 def add_rec(start, end, list_param, tree: BST):
@@ -86,6 +86,6 @@ if __name__ == "__main__":
     tree2 = BST()
     for i in range(test):
         tree2.add(i)
-    r = list(node.value for node in tree.inOrder())
-    r2 = list(node.value for node in tree2.inOrder())
+    r = list(node.value for node in tree.in_order())
+    r2 = list(node.value for node in tree2.in_order())
     assert r == r2