StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POhelp with insert on first BST
primarykey
Id
5798616
data
AcceptedAnswerId
5798734
AnswerCount
4
ClosedDate
CommentCount
4
CommunityOwnedDate
CreationDate
2011-04-27T02:15:08.853
FavoriteCount
0
LastActivityDate
2011-04-27T04:01:59.543
LastEditDate
2011-04-27T03:51:42.147
LastEditorUserId
645726
OwnerUserId
645726
ParentId
0
PostTypeId
1
Score
1
ViewCount
354
LastEditorDisplayName
text
Body
EDIT there a small thing that I am missing!! the error is still there So I am attempting to learn how to code my first BST, and it is hard.... I am already having trouble with just a few lines of codes. the problem is in the insert, but I have included everything so that I could get some feedback on my style/other errors. I was suggested to use a pointer to pointer implementation, but we havent learned it yet, so I dont feel comfort/know how to code it yet. the error is <pre><code>[trinhc@cs1 Assignment_3]$ g++ movieList.cpp -o a.out /tmp/ccLw6nsv.o: In function `main': movieList.cpp:(.text+0x7a): undefined reference to `Tree::Tree()' movieList.cpp:(.text+0xa7): undefined reference to `Tree::insert(int, std::basic_string<char, std::char_traits<char>, std::allocator<char> >)' collect2: ld returned 1 exit status </code></pre> the tree.h file <pre><code>#ifndef TREE_H #define TREE_H #include <string> #include <iostream> using namespace std; class Tree { public: Tree(); bool insert(int k, string s); private: struct Node { int key; string data; Node *left; Node *right; }; Node* root; bool insert(Node*& root, int k, string s); }; #endif </code></pre> tree.cpp <pre><code>#include <iostream> #include "tree.h" #include <stack> #include <queue> #include <string> using namespace std; Tree::Tree() { root = NULL; } bool Tree::insert(int k, string s) { return insert(root, k, s); } bool Tree::insert(Node*& current_root, int k, string s) { if(root == NULL){ current_root = new Node; current_root->key = k; current_root->data = s; current_root->left = NULL; current_root->right = NULL; return true; } else if (current_root->key == k) return false; else if (current_root->key > k) insert(current_root->left, k, s); else insert (current_root->right,k, s); } </code></pre> movieList.cpp <pre><code>#include <iostream> #include <stack> #include <queue> #include <string> #include "tree.h" using namespace std; int main() { Tree test; test.insert(100, "blah"); return 0; } </code></pre>
Tags
<c++><g++><binary-tree><binary-search-tree>
Title
help with insert on first BST
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USkingcong3
UserOwnerUserId
1. USkingcong3
plurals
PostLinksPostIdRelatedPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POhelp with insert on first BST
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
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.