From c64f3318f83f97d359fdc49187bba57fdafab647 Mon Sep 17 00:00:00 2001 From: bt3gl <138340846+cypher-bt3gl@users.noreply.github.com> Date: Sat, 29 Jul 2023 17:45:13 -0700 Subject: [PATCH] Update lowest_common_ancestor.py --- trees_and_graphs/lowest_common_ancestor.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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):