Lowest Common Ancestor of a Binary Search Tree LeetCode solution in JavaScript

1
var lowestCommonAncestor = function (root, p, q) {
2
  while (root) {
3
    if (p.val > root.val && q.val > root.val) {
4
      root = root.right;
5
    } else if (p.val < root.val && q.val < root.val) {
6
      root = root.left;
7
    } else {
8
      return root;
9
    }
10
  }
11
};