首页 > 代码库 > Lowest Common Ancestor of a Binary Tree
Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor of two given nodes in the tree.
Node* LCA(Node* root, Node* p, Node* q){ if (root == NULL || p == NULL || q == NULL) return NULL; if (root == p || root == q) return root; Node* L = LCA(root->left, p, q); Node* R = LCA(root->right, p, q); if (L && R) return root; else L ? L : R;}
Lowest Common Ancestor of a Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。