StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POBinary Search Tree(search function returning NULL)
primarykey
Id
15071888
data
AcceptedAnswerId
15071961
AnswerCount
1
ClosedDate
CommentCount
4
CommunityOwnedDate
CreationDate
2013-02-25T16:42:40.243
FavoriteCount
0
LastActivityDate
2013-02-25T17:07:10.610
LastEditDate
2013-02-25T17:07:10.610
LastEditorUserId
1777067
OwnerUserId
1777067
ParentId
0
PostTypeId
1
Score
0
ViewCount
173
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>::LoadTree(const char *file) { ifstream fin; fin.open(file); string buffer; T buff; while (!fin.eof()) { getline(fin,buffer,'~'); fin>>buff; TreeNode<T> *temp,*temp1; temp=Root; temp1=temp; while (temp!=NULL) { temp1=temp; if (temp->key>buff) { temp=temp->LeftChild; } else if (temp->key<buff) { temp=temp->RightChild; } } temp=new TreeNode<T>(buff,buffer); if (temp!=Root) temp->Parent=temp1; cout<<temp->value<<temp->key<<endl; if (temp->LeftChild!=0) cout<<(temp->LeftChild)->value<<endl; } fin.close(); } template <class T> string BinaryTree<T>::searchNode(T Key) { TreeNode<T> *temp=Root; while (temp!=NULL) { if (temp->key==Key) { return temp->value; } if (temp->key>Key) { temp=temp->LeftChild; } else if (temp->key<Key) { temp=temp->RightChild; } } return "\0"; } </code></pre> <p>Above are the header file and constructor and functions for building tree from a file and searching a node in it.I don't understand what am I missing in my function because whenever i run the search function,it always returns NULL which is the default condition when the node key exists in the file/tree. Thanks a lot everyone,it's working now.I am really grateful.I used my insert function to build up my tree.</p> <pre><code>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; insertNode(buff,buffer); } fin.close(); } </code></pre>
Tags
<c++>
Title
Binary Search Tree(search function returning NULL)
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. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
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.