Skip to content

wrong index has been fixed #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
iHR4K wants to merge 3 commits into
base: main
Choose a base branch
from
Open

wrong index has been fixed #1

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
01f9fae
wrong index has been fixed
iHR4K Aug 3, 2023
588b1cb
another wrong index
iHR4K Aug 3, 2023
5c3e73b
it looks like d was used by mistake
iHR4K Aug 3, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -132,7 +132,7 @@ Node *findMinRec(Node* root, int d, unsigned depth)
// in this subtree
return minNode(root,
findMinRec(root->left, d, depth+1),
findMinRec(root->right, d, depth+1), d);
findMinRec(root->right, d, depth+1), cd);
}

// A wrapper over findMinRec(). Returns minimum of d'th dimension
Expand Down Expand Up @@ -225,7 +225,7 @@ int main()
//Testing out minimum value in a 3-dimensional tree.
struct Node *minVal = NULL;
findMin(root, 3);
cout << "(" << root->point[0] << "," << root->point[1] <<"," << root->point[3] << ")" << endl;
cout << "(" << root->point[0] << "," << root->point[1] <<"," << root->point[2] << ")" << endl;


//Testing the search functionality of a 3-dimensional Tree.
Expand All @@ -245,9 +245,9 @@ int main()
root = deleteNode(root, points[0]);

cout << "Root after deletion of (" << origRoot->point[0] <<"," << origRoot->point[1] <<"," << origRoot->point[2] << ")\n";
cout << root->point[0] << "," << root->point[1] <<"," << root->point[3] << endl;
cout << root->point[0] << "," << root->point[1] <<"," << root->point[2] << endl;



return 0;
}
}