New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

树中两个节点的最低公共祖先 - haoc7 #818

Open

itcuihao opened this issue Jun 9, 2022 · 1 comment

Labels

372a0d33942d8ac4f808413ce36161fa Gitalk

Owner

itcuihao commented Jun 9, 2022

http://cuihao.fun/post/%E6%A0%91%E4%B8%AD%E4%B8%A4%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E4%BD%8E%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/

在《剑指Offer》7.2 章中，面试案例：树中两个节点的最低公共祖先，记录了如下面试流程：面试官：让我们做一个编程题目吧。输入树的两个节点，求他们的最低公共祖先

itcuihao added Gitalk 372a0d33942d8ac4f808413ce36161fa labels

Owner Author

itcuihao commented Jun 9, 2022

温故而知新

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment