它的左、右子树也分别为二叉排序树。 https://www.geeksforgeeks.org/lowest-common-ancestor-in-a-binary-search-tree/ We can solve this problem using BST properties.We canrecursively traversethe BST from root. The main idea of the solution is, while traversing from top to bottom, the first nod...