ValidateBinarySearchTree::helper() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

ValidateBinarySearchTree::helper() B
last analyzed 2022-03-29 06:17 UTC

↳ Parent: ValidateBinarySearchTree

Complexity

Conditions	7
Paths	5

Size

Total Lines	14
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	8
c	2
b	0
f	0
dl	0
loc	14
rs	8.8333
cc	7
nc	5
nop	3

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class ValidateBinarySearchTree
{
    public static function isValidBST(TreeNode $root): bool
    {
        return self::helper($root);
    }

    public static function isValidBST2(TreeNode $root): bool
    {
        if ($root === null) {
            return true;
        }
        [$stack, $prev] = [[], null];
        while ($root !== null || $stack) {
            while ($root !== null) {
                $stack[] = $root;
                $root = $root->left;
            }
            $root = array_pop($stack);
            if ($prev !== null && $prev instanceof TreeNode && $root->val <= $prev->val) {
                return false;
            }
            $prev = $root;
            $root = $root->right;
        }

        return true;
    }

    private static function helper(TreeNode $root = null, $min = null, $max = null): bool
    {
        if ($root === null) {
            return true;
        }
        if ($min !== null && $min >= $root->val) {
            return false;
        }
        if ($max !== null && $max <= $root->val) {
            return false;
        }

        return self::helper($root->left, $min, $root->val) &&
            self::helper($root->right, $root->val, $max);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			use leetcode\util\TreeNode;
8
9			class ValidateBinarySearchTree
10			{
11			public static function isValidBST(TreeNode $root): bool
12			{
13			return self::helper($root);
14			}
15
16			public static function isValidBST2(TreeNode $root): bool
17			{
18			if ($root === null) {
19			return true;
20			}
21			[$stack, $prev] = [[], null];
22			while ($root !== null \|\| $stack) {
23			while ($root !== null) {
24			$stack[] = $root;
25			$root = $root->left;
26			}
27			$root = array_pop($stack);
28			if ($prev !== null && $prev instanceof TreeNode && $root->val <= $prev->val) {
29			return false;
30			}
31			$prev = $root;
32			$root = $root->right;
33			}
34
35			return true;
36			}
37
38			private static function helper(TreeNode $root = null, $min = null, $max = null): bool
39			{
40			if ($root === null) {
41			return true;
42			}
43			if ($min !== null && $min >= $root->val) {
44			return false;
45			}
46			if ($max !== null && $max <= $root->val) {
47			return false;
48			}
49
50			return self::helper($root->left, $min, $root->val) &&
51			self::helper($root->right, $root->val, $max);
52			}
53			}
54

imajinyun / leetcode-php

ValidateBinarySearchTree::helper() B last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

ValidateBinarySearchTree::helper() B
last analyzed 2022-03-29 06:17 UTC