Website Summary Files Commits Branches @commit @diff @stats
diff options
context:
space:
mode:
Commit18ca196671d903c0d237536dc33ec780dcd2084a (patch)
Author
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-12-13 16:37:12 +0200
Committer
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-12-13 16:37:12 +0200
Filesec9ffc0f5fe545642efcdc9231584f74af51cdcf
Data-structures-and-algorithms-18ca196671d903c0d237536dc33ec780dcd2084a.tar
Data-structures-and-algorithms-18ca196671d903c0d237536dc33ec780dcd2084a.tar.gz
Data-structures-and-algorithms-18ca196671d903c0d237536dc33ec780dcd2084a.zip
Parentb3f52d21d883d5c4ad6e7e582ea9bc067dd2c2f0 (diff)
style fix
1 files changed, 1 insertions, 2 deletions
-rw-r--r--Seminar08/tree-utils.h3
diff --git a/Seminar08/tree-utils.h b/Seminar08/tree-utils.h
index 531aa9d..3ce0d93 100644
--- a/Seminar08/tree-utils.h
+++ b/Seminar08/tree-utils.h
@@ -120,7 +120,6 @@ void innerVertexRemoveCase(Tree<T>*& inVertex) {
firstGoingDown = false;
}
- bool isLeaf = ((*minNode)->right == nullptr);
Tree<T>* originalRight = (*minNode)->right;
(*minNode)->left = inVertex->left;
@@ -133,7 +132,7 @@ void innerVertexRemoveCase(Tree<T>*& inVertex) {
inVertex = (*minNode);
if (!firstGoingDown)
- (*minNodeParent)->left = isLeaf ? nullptr : originalRight;
+ (*minNodeParent)->left = originalRight;
delete toDelete;
}