StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
19914495
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-11-11T19:42:24.357
FavoriteCount
0
LastActivityDate
2013-11-11T19:42:24.357
LastEditDate
LastEditorUserId
0
OwnerUserId
2247192
ParentId
19899981
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
<p>Here we are. This seems to work. If anyone has any suggestions as to how I can optimize this or a problem that I need to fix please speak up! Thanks!</p> <pre><code>void BinaryTree::remove(int data){ // Is the data valid? if(data < 0){ cerr << data << " is not valid. Must be a positive integer value." << endl; } else{ // Find the node BinNode* loc = root; BinNode* parent = nullptr; bool found = false; while(!found && loc != nullptr){ if(data > loc->data){ parent = loc; loc = loc->right; } else if(data < loc->data){ parent = loc; loc = loc->left; } else found = true; // If there are children, save pointers to them BinNode* leftChild = nullptr; BinNode* rightChild = nullptr; if(loc->left != nullptr) leftChild = loc->left; if(loc->right != nullptr) rightChild = loc->right; // So now pointers to the children have been saved (if they exist) and // parent pointers have been taken care of (if they exist) the node can be deleted // If no children exist simply just delete the node and return // Check if two children exist if(leftChild != nullptr && rightChild != nullptr){ // Find a minimum in the right subtree BinNode * min = loc->right; BinNode * minParent = loc; while(min->left != nullptr){ minParent = min; min = min->left; } // Replace value of the node to be removed with the found minimum loc->data = min->data; // Delete the duplicate if(minParent != loc) minParent->left = nullptr; else minParent->right = nullptr; delete min; } // If one child exists // Need to handle if it is the root here // change root pointer to remaining child else if(leftChild != nullptr || rightChild != nullptr){ // If there is a parent, take care of the pointer if(parent != nullptr){ if(loc->data < parent->data) parent->left = nullptr; else if(loc->data > parent->data) parent->right = nullptr; // Now loc can be deleted delete loc; if(leftChild != nullptr){ if(parent != nullptr){ if(leftChild->data < parent->data) parent->left = leftChild; else if(leftChild->data > parent->data) parent->right = leftChild; } // If it is the root else{ root = leftChild; } } else if(rightChild != nullptr){ if(parent != nullptr){ if(rightChild->data < parent->data) parent->left = rightChild; else if(rightChild->data > parent->data) parent->right = rightChild; } // If it is the root else{ root = rightChild; } } } // If there are no children else if (leftChild == nullptr && rightChild == nullptr){ // If there is a parent, take care of the pointer if(parent != nullptr){ if(loc->data < parent->data) parent->left = nullptr; else if(loc->data > parent->data) parent->right = nullptr; } // If it is the root else root = nullptr; delete loc; } } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PORemoving a node with two children in a Binary Tree
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USRiptyde4
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.