CHORE: add newline

Author: crumbs22

lowest-common-ancestor-of-a-binary-search-tree/aa601.py

@@ -19,4 +19,4 @@ def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -
 			elif p.val > root.val and q.val > root.val:
 				root = root.right
 			else:
-				return root
+				return root