PAT 1143. Lowest Common Ancestor (30) – 甲级

柳婼

已于 2023-11-09 15:53:19 修改

阅读量2.6k

点赞数 26

文章标签：算法 c++ 图论

于 2018-03-19 22:34:19 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/79618849

版权

The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.
A binary search tree (BST) is recursively defined as a binary tree which has the following properties:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
Given any two nodes in a BST, you are supposed to find their LCA.

Input Specification: