leetcode\SearchInABinarySearchTree

Complexity

Total Complexity

10

Size/Duplication

Total Lines	34
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	searchBST2()	0	17	6
A	searchBST()	0	12	4

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class SearchInABinarySearchTree
{
    public static function searchBST(?TreeNode $root, int $val): ?TreeNode
    {
        if (!$root) {
            return $root;
        }

        if ($root->val > $val) {
            return self::searchBST($root->left, $val);
        } elseif ($root->val < $val) {
            return self::searchBST($root->right, $val);
        } else {
            return $root;
        }
    }

    public static function searchBST2(?TreeNode $root, int $val): ?TreeNode
    {
        if (!$root) {
            return $root;
        }
        $curr = $root;
        while ($curr && $curr instanceof TreeNode) {
            if ($curr->val > $val) {
                $curr = $curr->left;
            } elseif ($curr->val < $val) {
                $curr = $curr->right;
            } else {
                return $curr;
            }
        }

        return $curr;
    }
}