首页 > TAG信息列表 > leetcode236
leetcode236.二叉树的最近公共祖先
leetcode236.二叉树的最近公共祖先 题目 给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。 百度百科中最近公共祖先的定义为：“对于有根树 T 的两个节点 p、q，最近公共祖先表示为一个节点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（一个节点也可以是它自己的祖先）。” 用例LeetCode236 lowest Common Ancestor of a binary tree（二叉树的最近公共祖先）
题目 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and qLeetCode236. 二叉树的最近公共祖先
* @lc app=leetcode.cn id=236 lang=cpp * * [236] 二叉树的最近公共祖先 * * https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/description/ * * algorithms * Medium (58.46%) * Likes: 300 * Dislikes: 0LeetCode236. Lowest Common Ancestor of a Binary Tree(二叉树的最近公共祖先)
236. Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q asleetcode236.二叉树的最低公共祖先（未完成，为看懂）
1.递归 参考：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/discuss/65369/Short-and-clean-C%2B%2B-solution 递归没看懂，如果递归函数是返回最低祖先的话，那么当l不为空的话，说明p,q在左子树中，那么r一定是为空的，但是代码里if(l && r) return root;说