leetcode\LowestCommonAncestorOfABinarySearchTree

Complexity

Total Complexity

6

Size/Duplication

Total Lines	15
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	lowestCommonAncestor()	0	13	6

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class LowestCommonAncestorOfABinarySearchTree
{
    public static function lowestCommonAncestor(TreeNode $root, TreeNode $p, TreeNode $q): ?TreeNode
    {
        while ($root) {
            if ($p->val < $root->val && $q->val < $root->val) {
                $root = $root->left;
            } elseif ($p->val > $root->val && $q->val > $root->val) {
                $root = $root->right;
            } else {
                return $root;
            }
        }

        return null;
    }
}