Leetcode:235. 二叉搜索树的最近公共祖先

2023-05-28,,

Leetcode:235. 二叉搜索树的最近公共祖先

Leetcode:235. 二叉搜索树的最近公共祖先

Talk is cheap . Show me the code .

/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root==NULL) return NULL;
if(root->val>p->val&&root->val>q->val) return lowestCommonAncestor(root->left,p,q);
if(root->val<p->val&&root->val<q->val) return lowestCommonAncestor(root->right,p,q);
return root;
}
};

Leetcode:235. 二叉搜索树的最近公共祖先的相关教程结束。

《Leetcode:235. 二叉搜索树的最近公共祖先.doc》

下载本文的Word格式文档,以方便收藏与打印。