Given two nodes in an arbitrary tree, write a function to find the most-specific-common-ancestor.

Given two nodes in an arbitrary tree, write a function to find the most-specific-common-ancestor.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, ntt-data, company-specific

目标公司: NTT DATA

参考答案摘要

Below example Python function to find the most specific common ancestor of two nodes in an arbitrary tree: def find_lca(root, node1, node2): if root is None: return None if root == node1 or root == no...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。