StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POBinary Search Tree--delete function not working
primarykey
Id
15094225
data
AcceptedAnswerId
15094769
AnswerCount
2
ClosedDate
2013-02-26T21:44:41.387
CommentCount
11
CommunityOwnedDate
CreationDate
2013-02-26T16:28:00.367
FavoriteCount
0
LastActivityDate
2013-02-26T17:17:04.437
LastEditDate
2013-02-26T17:17:04.437
LastEditorUserId
1777067
OwnerUserId
1777067
ParentId
0
PostTypeId
1
Score
0
ViewCount
262
LastEditorDisplayName
text
Body
<pre><code>#include <iostream> #include <string> #include <fstream> using namespace std; template <class T> struct TreeNode{ string value; T key; TreeNode<T> *Parent; TreeNode<T> *LeftChild; TreeNode<T> *RightChild; TreeNode (T k,string Val) { this->value=Val; this->key=k; this->Parent=NULL; this->LeftChild=NULL; this->RightChild=NULL; } }; template <class T> class BinaryTree{ private: TreeNode<T> *Root; public: BinaryTree(); void LoadTree(const char file[]); ~BinaryTree(); void insertNode(T Key,string Val); void deleteNode(T Key); string searchNode(T Key); void UpdateKey(T newkey,T oldkey); int Height(TreeNode<T> *node); int height(); }; template <class T> BinaryTree<T>::BinaryTree() { Root=NULL; } template <class T> void BinaryTree<T>::insertNode(T Key,string Val) { TreeNode<T> **temp=&Root; TreeNode<T> *temp1=NULL; if (*temp==NULL) { Root=new TreeNode<T>(Key,Val); return; } else { while (*temp!=NULL) { temp1=*temp; if (temp1->key>Key) { temp=&(*temp)->LeftChild; } else if (temp1->key<Key) { temp=&(*temp)->RightChild; } } } *temp=new TreeNode<T>(Key,Val); (*temp)->Parent=temp1; } template <class T> void BinaryTree<T>::LoadTree(const char *file) { ifstream fin; fin.open(file); string buffer; T buff; while (!fin.eof()) { getline(fin,buffer,'~'); fin>>buff; if (!buff) continue; insertNode(buff,buffer); } fin.close(); } void BinaryTree<T>::deleteNode(T Key) { TreeNode<T> *temp=Root; TreeNode<T> *temp1=temp; while (temp!=NULL) { if (temp->key==Key) { temp1=temp; if (temp==Root) { TreeNode<T> *temp2=Root; temp2=temp2->RightChild; while (temp2->LeftChild!=NULL) { temp2=temp2->LeftChild; } temp->key=temp2->key; temp->value=temp2->value; delete temp2; } else if (temp->RightChild==NULL) { TreeNode<T> *temp2=temp; temp2=temp->Parent; if (temp2->RightChild==temp) { temp2->RightChild=temp->LeftChild; (temp->LeftChild)->Parent=temp2; } else if (temp2->LeftChild==temp) { temp2->LeftChild=temp->LeftChild; (temp->LeftChild)->Parent=temp2; } delete temp1; delete temp; return; } else if (temp->LeftChild==NULL) { TreeNode<T> *temp2=temp; temp2=temp->Parent; if (temp2->RightChild==temp) { temp2->RightChild=temp->RightChild; (temp->RightChild)->Parent=temp2; } else if (temp2->LeftChild==temp) { temp2->LeftChild=temp->RightChild; (temp->RightChild)->Parent=temp2; } delete temp1; delete temp; return; } else if (temp->RightChild!=NULL) { TreeNode<T> *tmp=temp; temp=temp->RightChild; if (temp->LeftChild!=NULL) { while (temp->LeftChild!=NULL) { tmp=temp; temp=temp->LeftChild; } } if (tmp!=temp1) tmp->LeftChild==NULL; else temp1->RightChild==NULL; temp1->key=temp->key; temp1->value=temp->value; delete temp; return; } } if (temp->key>Key) { temp=temp->LeftChild; } else if (temp->key<Key) { temp=temp->RightChild; } } return; } </code></pre> <p>This is part of the code for a Binary Search tree that I am making.I am facing a problem when I run the delete function i.e for some nodes, i am getting the error "testing.exe has stopped working".testing is name of my main file.I have checked again and again but I don't seem to find the problem.Can anyone see the problem?Thanks</p>
Tags
<c++>
Title
Binary Search Tree--delete function not working
singulars
PostAcceptedAnswerId
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USdigi_exp527
UserOwnerUserId
1. USdigi_exp527
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. PL
  singulars
  LinkTypeLinkTypeId
  LTLinked
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
2. PO
  singulars
  PostTypePostTypeId
  PTAnswer
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  POBinary Search Tree--delete function not working
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTClose
2. VO
  singulars
  PostPostId
  POBinary Search Tree--delete function not working
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTClose
3. VO
  singulars
  PostPostId
  POBinary Search Tree--delete function not working
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTClose
CommentsPostId

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.