leetcode 235 Lowest Common Ancestor of a Binary Search Tree

Java:

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        while((root.val - p.val) * (root.val - q.val) >0){
            root = p.val < root.val? root.left:root.right;
        }
        return root;
    }
}