diff --git a/trees_and_graphs/lowest_common_ancestor.py b/trees_and_graphs/lowest_common_ancestor.py
index 8d96e17..e4082ec 100644
--- a/trees_and_graphs/lowest_common_ancestor.py
+++ b/trees_and_graphs/lowest_common_ancestor.py
@@ -3,7 +3,7 @@ Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in
 '''
 
 class ThisTree:
-    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+    def lowest_common_ancestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
         
         def dfs(root, p, q):