Jingga/phpOMS
1
0
Fork 0
mirror of https://github.com/Karaka-Management/phpOMS.git synced 2026-01-21 05:48:41 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

null checks

Browse Source
This commit is contained in:
Dennis Eichhorn 2023-10-15 18:14:27 +00:00
parent 0b5d51f9b8
commit e997408bb6
1 changed files with 19 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
Stdlib/Tree/BinarySearchTree.php
View File

@ -180,7 +180,7 @@ class BinarySearchTree
}
$current = $this->root;
while (true) {
while ($current !== null) {
$comparison = $node->compare($current->data);
if ($comparison < 0) {
@ -226,9 +226,13 @@ class BinarySearchTree
{
if ($node->left === null && $node->right === null) {
if ($node->parent !== null) {
if ($node->parent->left !== null && $node->parent->left->root->compare($node->data) === 0) {
if ($node->parent->left !== null
&& $node->parent->left->root?->compare($node->data) === 0
) {
$node->parent->left = null;
} elseif ($node->parent->right !== null && $node->parent->right->root->compare($node) === 0) {
} elseif ($node->parent->right !== null
&& $node->parent->right->root->compare($node) === 0
) {
$node->parent->right = null;
}
}
@ -242,9 +246,13 @@ class BinarySearchTree
if ($node->left === null) {
$temp = $node->right->root;
if ($node->parent !== null) {
if ($node->parent->left !== null && $node->parent->left->root->compare($node->data) === 0) {
if ($node->parent->left !== null
&& $node->parent->left->root?->compare($node->data) === 0
) {
$node->parent->left = $temp->tree;
} elseif ($node->parent->right !== null && $node->parent->right->root->compare($node->data) === 0) {
} elseif ($node->parent->right !== null
&& $node->parent->right->root?->compare($node->data) === 0
) {
$node->parent->right = $temp->tree;
}
}
@ -259,9 +267,13 @@ class BinarySearchTree
if ($node->right === null) {
$temp = $node->left->root;
if ($node->parent !== null) {
if ($node->parent->left !== null && $node->parent->left->root->compare($node->data) === 0) {
if ($node->parent->left !== null
&& $node->parent->left->root?->compare($node->data) === 0
) {
$node->parent->left = $temp->tree;
} elseif ($node->parent->right !== null && $node->parent->right->root->compare($node->data) === 0) {
} elseif ($node->parent->right !== null
&& $node->parent->right->root?->compare($node->data) === 0
) {
$node->parent->right = $temp->tree;
}
}