Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

二叉搜索树的两个结点找他们的最低的公共祖先。

代码：