LeetCode 235 二叉搜索树的最近公共祖先

二叉搜索树的最近公共祖先

/**
 * 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) {
	//二叉搜索树的最近公共祖先的算法,这种题目特别简单
	//不停地进行深度优先遍历
	TreeNode* p1 = root;
	if (root == NULL)
		return NULL;
	stack<TreeNode*> st;
	while (p1 != NULL)
	{
		if (p1->val > p->val&&p1->val > q->val)
		{
			p1 = p1->left;
		}
		else if (p1->val < p->val&&p1->val < q->val)
		{
			p1 = p1->right;
		}
		else
		{
			return p1;
		}
	}
	return NULL;
}
};