[LeetCode235]Lowest Common Ancestor of a Binary Search Tree
Posted zhangbaochong
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode235]Lowest Common Ancestor of a Binary Search Tree相关的知识,希望对你有一定的参考价值。
题目:
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”
_______6______ / ___2__ ___8__ / \ / 0 _4 7 9 / 3 5
For example, the lowest common ancestor (LCA) of nodes 2
and 8
is 6
. Another example is LCA of nodes 2
and 4
is 2
, since a node can be a descendant of itself according to the LCA definition.
二叉搜索树求两个结点最近的祖先
分类:Tree
代码:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { 13 if(p->val < root->val && q->val < root->val) 14 return lowestCommonAncestor(root->left,p,q); 15 if(p->val > root->val && q->val > root->val) 16 return lowestCommonAncestor(root->right,p,q); 17 return root; 18 } 19 };
以上是关于[LeetCode235]Lowest Common Ancestor of a Binary Search Tree的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 235. Lowest Common Ancestor of a Binary Search Tree
LeetCode_235. Lowest Common Ancestor of a Binary Search Tree
leetcode 235. Lowest Common Ancestor of a Binary Search Tree
Leetcode235. Lowest Common Ancestor of a Binary Search Tree