tri11paragon
/
BLT
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix search infinite loop on not foundo

v1
Brett 2023-01-10 22:30:54 -05:00
parent 0926d7cc00
commit 15eaf59503
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/blt/std/binary_tree.h
View File

@ -67,6 +67,8 @@ namespace blt {
while (true) { while (true) {
if (searchNode->payload == element) if (searchNode->payload == element)
return searchNode; return searchNode;
if (searchNode->left == nullptr && searchNode->right == nullptr)
return nullptr;
// check for left and right tree traversal if it exists // check for left and right tree traversal if it exists
if (searchNode->left != nullptr && element < searchNode->left->payload) { if (searchNode->left != nullptr && element < searchNode->left->payload) {
*parent = searchNode; *parent = searchNode;