Leetcode problem solving - 235 Nearest common ancestor of binary search tree

public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
    
        TreeNode max = p.val>q.val?p:q;
        TreeNode min = p.val<q.val?p:q;
        while (root!=null){
    
            if (root.val>=min.val&&root.val<=max.val) return root;
            if (root.val>max.val) root = root.left;
            if (root.val<min.val) root = root.right;
        }
        return root;
    }

Ideas ：
Based on the characteristics of binary search tree, we iterate layer by layer , Finally, when the current node value is between two node values , It is the common parent node of these two nodes