/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode *dfs(int left, int right, struct TreeNode* root) {
if(root->val < left) {
return dfs(left, right, root->right);
}
if(root->val > right) {
return dfs(left, right, root->left);
}
return root;
}
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
struct TreeNode *node = NULL;
int left = p->val;
int right = q->val;
if(p->val > q->val) {
left = q->val;
right = p->val;
}
node = dfs(left, right, root);
return node;
}
代码随想录算法训练营第17天
最新推荐文章于 2024-05-23 00:22:50 发布