Lowest Common Ancestor of a Binary Search Tree (BST)
2014-12-16 23:39
465 查看
Given a binary search tree(BST), find the lowest common ancestor of two given nodes in the BST.
Node* LCA(Node* root, Node* p, Node* q) { if (!root || !p || !q) return NULL; if (max(p->data, q->data) < root->data) return LCA(root->left, p, q); else if (min(p->data, q->data) < root->data) return LCA(root->right, p, q); else return root; }
相关文章推荐
- Lowest Common Ancestor of a Binary Search Tree (BST)
- 72【leetcode】经典算法- Lowest Common Ancestor of a Binary Search Tree(lct of bst)
- 72【leetcode】经典算法- Lowest Common Ancestor of a Binary Search Tree(lct of bst)
- 72【leetcode】经典算法- Lowest Common Ancestor of a Binary Search Tree(lct of bst)
- LeetCode:Lowest Common Ancestor of a Binary Search Tree(BST最近公共祖先)
- 72【leetcode】经典算法- Lowest Common Ancestor of a Binary Search Tree(lct of bst)
- leetcode 235. Lowest Common Ancestor of a Binary Search Tree 二叉搜索树BST的最近公共祖先LCA + 深度优先遍历DFS
- My Solution to Lowest Common Ancestor of a Binary Search Tree (BST)
- 72【leetcode】经典算法- Lowest Common Ancestor of a Binary Search Tree(lct of bst)
- Lowest Common Ancestor of Binary Search Tree (BST)
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree
- 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
- LeetCode || Lowest Common Ancestor of a Binary Search Tree
- [LeetCode] Lowest Common Ancestor of a Binary Search Tree
- 235. Lowest Common Ancestor of a Binary Search Tree | 二叉查找树两个节点的最低共同祖先
- 开始刷leetcode day62:Lowest Common Ancestor of a Binary Search Tree
- LeetCode[235] Lowest Common Ancestor of a Binary Search Tree