StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POWeird error in binary search tree
primarykey
Id
5372084
data
AcceptedAnswerId
5372200
AnswerCount
1
ClosedDate
2011-03-21T13:03:30.160
CommentCount
11
CommunityOwnedDate
CreationDate
2011-03-20T22:47:01.683
FavoriteCount
0
LastActivityDate
2011-03-20T23:08:06.207
LastEditDate
2011-03-20T23:08:06.207
LastEditorUserId
658266
OwnerUserId
658266
ParentId
0
PostTypeId
1
Score
-3
ViewCount
216
LastEditorDisplayName
text
Body
<pre><code>#include <iostream> using namespace std; #define YES 1 #define NO 0 class tree { private: public: struct leaf { int data; leaf *l; leaf *r; }; struct leaf *p; tree(); ~tree(); void destruct(leaf *q); tree(tree& a); void add(int n); void transverse(); void in(leaf *q); void pre(leaf *q); void post(leaf *q); leaf* createBST(int *preOrder, int* inOrder, int len); }; tree::tree() { p=NULL; } tree::~tree() { destruct(p); } void tree::destruct(leaf *q) { } void tree::transverse() { int c; cout<<"\n1.InOrder\n2.Preorder\n3.Postorder\nChoice: "; cin>>c; switch(c) { case 1: in(p); break; case 2: pre(p); break; case 3: post(p); break; } } void tree::in(leaf *q) { if(q!=NULL) { in(q->l); cout<<"\t"<<q->data<<endl; in(q->r); } } void tree::pre(leaf *q) { if(q!=NULL) { cout<<"\t"<<q->data<<endl; pre(q->l); pre(q->r); } } void tree::post(leaf *q) { if(q!=NULL) { post(q->l); post(q->r); cout<<"\t"<<q->data<<endl; } } tree::leaf* tree::createBST(int *preOrder, int* inOrder, int len) { int i; tree::leaf *bst = new tree::leaf; // tree bst; // if(len < 0) // {//bst = NULL; // return bst;} bst->data = *preOrder; for(i = 0; i < len; i++) if(*(inOrder + i) == *preOrder) break; if(i>=0) bst->l = createBST(preOrder + 1, inOrder, i); if((len-i-1) >=0) bst->r = createBST(preOrder + i +1, inOrder + i + 1, len-i-1); return bst; } int main() { tree bst; int pre_data[] = {20,8,4,12,10,14,22}; int in_data[] = {4,8,10,12,14,20,22}; bst.p = bst.createBST(pre_data, in_data, 7); bst.transverse(); return 0; } </code></pre> <p>The main problem is in function </p> <pre><code> tree::leaf* tree::createBST(int *preOrder, int* inOrder, int len) </code></pre> <p>Note: I've posted two questions about this. Because I modified my code a lot I started a fresh post. </p>
Tags
<c++><tree><binary-search-tree>
Title
Weird error in binary search tree
singulars
PostAcceptedAnswerId
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USuser658266
UserOwnerUserId
1. USuser658266
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. VO
  singulars
  PostPostId
  POWeird error in binary search tree
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTDownMod
2. VO
  singulars
  PostPostId
  POWeird error in binary search tree
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTDownMod
3. VO
  singulars
  PostPostId
  POWeird error in binary search tree
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTDownMod
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.