c++二叉树问题

MagicBoy · 发表于 2003-11-23 14:49:02

the first file: tree.h
class tree
{
public:
      tree *left;
      int id;
      int data;
      tree *right;
      tree()
      {
      right = left = NULL;
      }
      ~tree()
      {

      }
};

class treecreate:public tree
{
public:
treecreate();
      ~treecreate();
      void create(int *,int *,int len);
      tree * insert_node(int,int);
      void preorder(tree *);
      void inorder();
      void postorder();
      void searchid(int num);
      void searchdata(int datanum);
      void print();
private:
treecreate::tree *root;
};

the second file: tree.cpp
#include <iostream>
#include "tree.h"

using namespace std;

treecreate::treecreate()
{
root = NULL;
}

treecreate::~treecreate()
{

}

void treecreate::create(int *id,int *data,int len)
{
int i;
for (i=0;i<len;i++)
root = insert_node(id,data);
}

tree * treecreate::insert_node(int nid,int ndata)
{
tree *newnode;
tree *currentnode;
tree *parentnode;

newnode = new tree;

newnode -> id = nid;
newnode -> data = ndata;
newnode -> left = NULL;
newnode -> right = NULL;

if (root == NULL)
root = newnode;
else{
currentnode = root;
while (currentnode != NULL)
{
parentnode = currentnode;
if(currentnode->id > nid)
currentnode=currentnode->left;
else
currentnode=currentnode->right;
}
if (parentnode->id > nid)
parentnode->left = newnode;
else
parentnode->right=newnode;
}
}

void treecreate::print()
{
tree *point;

point = root->left;
cout << "Print left_subtree node of root:" << endl;
while (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n", point->data);
point=point->left;
}
point = root->right;
cout << "Print right_subtree node of root:" << endl;
while (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n",point->data);
      point-point->right;
}
}

void preorder()
{
tree *point;
if (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n",point->data);
preorder(point->left);
preorder(point->right);
}
}

the third file: main.cpp
#include <iostream>
#include "tree.h"

using namespace std;

int main()
{
treecreate p;
int i,index;
int Kid,Kdata;
int idlist[20];
int datalist[20];

index = 0;

cout << endl << "Enter ID:";
cin >> Kid;

cout << endl << "Enter DATA:";
cin >> Kdata;

while (1)
{
idlist[index] = Kid;
datalist[index] = Kdata;
index = index + 1;
cout << endl << "Enter ID:";
cin >> Kid;
if (Kid == 0) break;
cout << endl << "Enter DATA:";
cin >> Kdata;
}

p.create(idlist,datalist,index);
p.print();
}

我觉的程序，好像没有对root指针操作，因为无结果输出，原因是root=NULL。
高手指点一下啊！！！ :-(  :-(  :-(  :-(  :-(

hibernate · 发表于 2003-11-23 22:29:14

你的函数你能编译通过?
你应该是根本没有编译通过或者说肯定是编译出错了吧?
tree * treecreate::insert_node(int nid,int ndata) 没有返回值吧
void treecreate::print() 打印逻辑肯定有错
首先：root没有打印
其次：打印节点，根本不是深度优先或者是广度优先
只打印最左边和最右边的根节点
void preorder() 根本不能这么写
你认为它会调用 treecreate::preorder(point->left);么，
preorder(point->left)函数不是static类型啊

MagicBoy · 发表于 2003-11-24 22:59:19

哈哈，那个没有改好！！！我知道print()函数是错的，我只是想看有没有结果输出。随便写的。
但是，我现在没有结果啊！！！那个函数的返回值我有写。我在贴好了。谢谢！！！

MagicBoy · 发表于 2003-11-24 23:11:41

the first file: tree.h
struct tree
{
int id;
int data;
tree *left;
tree *right;
};

typedef struct tree treenode;
typedef treenode *b_tree;

class treecreate
{
public:
treecreate();
      ~treecreate();
      b_tree create(int *,int *,int len);
      b_tree insert_node(b_tree,int,int);
      void preorder(b_tree);
      void inorder();
      void postorder();
      void searchid(int num);
      void searchdata(int datanum);
      void print();
};

the second file: tree.cpp
#include <iostream>
#include "tree.h"

using namespace std;

treecreate::treecreate()
{

}

treecreate::~treecreate()
{

}

b_tree treecreate::create(int *id,int *data,int len)
{
int i;
b_tree root = NULL;
for (i=0;i<len;i++)
root = insert_node(root,id,data);
return root;
}
b_tree treecreate::insert_node(b_tree root,int nid,int ndata)
{
b_tree newnode;
b_tree currentnode;
b_tree parentnode;

newnode = new tree;

newnode -> id = nid;
newnode -> data = ndata;
newnode -> left = NULL;
newnode -> right = NULL;

if (root == NULL)
return newnode;
else{
currentnode = root;
while (currentnode != NULL)
{
parentnode = currentnode;
if(currentnode->id > nid)
currentnode=currentnode->left;
else
currentnode=currentnode->right;
}
if (parentnode->id > nid)
parentnode->left = newnode;
else
parentnode->right=newnode;
}
return root;
}

/*void treecreate::print()
{
point = root->left;
cout << "Print left_subtree node of root:" << endl;
while (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n", point->data);
point=point->left;
}
point = root->right;
cout << "Print right_subtree node of root:" << endl;
while (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n",point->data);
      point=point->right;
}
}
*/

void treecreate::preorder(b_tree point)
{
if (point != NULL)
{
printf("[%2d]-",point->id);
printf("[%2d]\n",point->data);
preorder(point->left);
preorder(point->right);
}
}

the third file: main.cpp
#include <iostream>
#include "tree.h"

using namespace std;

int main()
{
treecreate p;
b_tree kroot;
int i,index;
int Kid,Kdata;
int idlist[20];
int datalist[20];

index = 0;

cout << endl << "Enter ID:";
cin >> Kid;

cout << endl << "Enter DATA:";
cin >> Kdata;

while (1)
{
idlist[index] = Kid;
datalist[index] = Kdata;
index = index + 1;
cout << endl << "Enter ID:";
cin >> Kid;
if (Kid == 0) break;
cout << endl << "Enter DATA:";
cin >> Kdata;
}

kroot = p.create(idlist,datalist,index);
p.preorder(kroot);
}

我搞定了，我用前序遍历可以了，不过，那个print()函数没有改，我注释掉了！！！谢谢！！！

		自动登录	找回密码
密码			注册