Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update lowest_common_ancestor.py

Browse Source
This commit is contained in:
bt3gl 2023-07-30 15:52:52 -07:00 committed by GitHub
parent d5089d5b0e
commit 35b14ddfde
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
trees_and_graphs/lowest_common_ancestor.py
View File

@ -1,8 +1,12 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
''' '''
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
''' '''
class ThisTree: class Tree:
def lowest_common_ancestor(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): def dfs(root, p, q):