【二叉树】最近公共祖先Lowest Common Ancestor of a Binary Tree

小青蛙法师

于 2017-06-06 10:30:27 发布

阅读量339

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ 文章标签：二叉树

本文链接：https://blog.youkuaiyun.com/yeahfeng520/article/details/72874518

C++ 专栏收录该内容

3 篇文章

订阅专栏

题目：求二叉树上两点的最近公共祖先

TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
    if (!root || root == p || root == q) return root;
    TreeNode* left = lowestCommonAncestor(root->left, p, q);
    TreeNode* right = lowestCommonAncestor(root->right, p, q);
    return !left ? right : !right ? left : root;
}