leetcode\InsertIntoABinarySearchTree

Complexity

Total Complexity

11

Size/Duplication

Total Lines	41
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	insertIntoBST()	0	14	5
A	insertIntoBST2()	0	23	6

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

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

        if ($root->val > $val) {
            $root->left = self::insertIntoBST($root->left, $val);
        }
        if ($root->val < $val) {
            $root->right = self::insertIntoBST($root->right, $val);
        }

        return $root;
    }

    public static function insertIntoBST2(?TreeNode $root, int $val): TreeNode
    {
        $curr = $root;
        while ($curr instanceof TreeNode) {
            if ($curr->val < $val) {
                if (!$curr->right) {
                    $curr->right = new TreeNode($val);
                    return $root;

The expression return $root could return the type null which is incompatible with the type-hinted return leetcode\util\TreeNode. Consider adding an additional type-check to rule them out.

                } else {
                    $curr = $curr->right;
                }
            }
            if ($curr->val > $val) {
                if (!$curr->left) {
                    $curr->left = new TreeNode($val);
                    return $root;

The expression return $root could return the type null which is incompatible with the type-hinted return leetcode\util\TreeNode. Consider adding an additional type-check to rule them out.

                } else {
                    $curr = $curr->left;
                }
            }
        }

        return new TreeNode($val);
    }
}