每天一道LeetCode题之二叉搜索树的最近公共祖先

题目：https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/

public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode froot = root;
        TreeNode sroot = root;
        ArrayList<TreeNode> fList = new ArrayList<>();
        ArrayList<TreeNode> sList = new ArrayList<>();
        while (froot != p){
            fList.add(froot);
            if (froot.val > p.val){
                froot = froot.left;
            }else {
                froot = froot.right;
            }
        }
        fList.add(froot);

        while (sroot != q){
            sList.add(sroot);
            if (sroot.val > q.val){
                sroot = sroot.left;
            }else {
                sroot = sroot.right;
            }
        }
        sList.add(sroot);

        fList.retainAll(sList);
        int size = fList.size();
        return fList.get(size-1);
    }
}

思路： 用集合1保存根节点到A的路径，用集合2保存根节点到B的路径，求集合1、2交集的最后一个元素，该元素就是最近的父结点。