代码思路和Lowest Common Ancestor of a Binary Tree 一模一样
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
if(root == NULL || root == p || root == q)
return root;
struct TreeNode *left = lowestCommonAncestor(root->left, p,q);
struct TreeNode *right = lowestCommonAncestor(root->right, p,q);
if(left&&right)
return root;
if(left)
return left;
if(right)
return right;
return NULL;
}
LeetCode 235. Lowest Common Ancestor of a Binary Search T...
235. Lowest Common Ancestor of a Binary Search Tree 题目：ht...
235. Lowest Common Ancestor of a Binary Search Tree 如果大于最...
235. Lowest Common Ancestor of a Binary Search Tree上一题：找最...
1143 Lowest Common Ancestor（30 分）The lowest common ancest...
Problem Given a binary search tree (BST), find the lowest...
https://leetcode.com/problems/lowest-common-ancestor-of-a...
如果树是查找树，可以优化
1.描述 Given a binary search tree (BST), find the lowest co...
Java，答案的想法很好，利用了二分树的特性
本文标题：235. Lowest Common Ancestor of a
本文链接：https://www.haomeiwen.com/subject/lnnbvxtx.html
网友评论