[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/binary_tree/splay_tree.py

@@ -4,13 +4,15 @@
 For Hacktoberfest contribution. Please label 'hacktoberfest-accepted'.
 """
 
+
 class Node:
     def __init__(self, key):
         self.left = None
         self.right = None
         self.parent = None
         self.key = key
 
+
 class SplayTree:
     def __init__(self):
         self.root = None
@@ -114,11 +116,12 @@ def inorder(self, node=None, result=None):
             self.inorder(node.right, result)
         return result
 
+
 # Example Usage / Test
 if __name__ == "__main__":
     tree = SplayTree()
     for key in [10, 20, 30, 40, 50, 25]:
         tree.insert(key)
-    print(tree.inorder())   # Output should be the inorder traversal of tree
+    print(tree.inorder())  # Output should be the inorder traversal of tree
     found = tree.search(30)
     print(f"Found: {found.key if found else None}")