請大家幫忙。

[orjava]

我剛學完C++﹐想拿一些源碼作參考﹐望各位大哥能提供一些﹐
部分也可﹐先謝謝各位了﹗﹗

[abitz]

还是看书吧。
书上的源码就挺好的。

[brisk]

给你一个二叉树的代码吧，有一点小问题，看看能不能解决，呵呵
#include <iostream.h>

template <class Type> class BinaryTree; //前视节点的类定义

template <class Type> class BinTreeNode { //二叉树节点类的定义
friend class BinaryTree<Type>;
public:
BinTreeNode ( ) : leftChild (NULL), rightChild (NULL) { } //无参构造函数
BinTreeNode ( Type item, BinTreeNode<Type> *left = NULL,
BinTreeNode<Type> *right = NULL ) :
data(item), leftChild(left), rightChild(right){}
Type GetData ( ) const { return data; }
BinTreeNode<Type> *GetLeft ( ) const
{ return leftChild; }
BinTreeNode<Type> *GetRight ( ) const
{ return rightChild; }
void SetData ( const Type & item )
{ data = item; }
void SetLeft ( BinTreeNode <Type> *L )
{ leftChild = L; }
void SetRight ( BinTreeNode <Type> *R )
{ rightChild = R; }
private:
BinTreeNode<Type> *leftChild, *rightChild;
Type data;
};

template <class Type> class BinaryTree {
public:
BinaryTree():root(NULL) { }
BinaryTree(Type value):RefValue(value), root(NULL){}
virtual ~BinaryTree() { destroy ( root ); }
virtual int IsEmpty() { return root == NULL ? 1 : 0; }
// virtual BinTreeNode <Type> *Parent(BinTreeNode <Type> *current)
// { return root == NULL || root==current? NULL : Parent ( root, current ); }

virtual BinTreeNode <Type> *LeftChild (BinTreeNode <Type> *current )
{ return root != NULL ?current->leftChild : NULL; }
virtual BinTreeNode <Type> *RightChild (BinTreeNode <Type> *current )
{ return root != NULL ?current->rightChild : NULL; }

// virtual int Insert ( const Type & item);
// virtual int Find ( const Type &item ) const;
void CreateBiTree(BinTreeNode<Type> *bitr);

const BinTreeNode <Type> *GetRoot ( ) const
{ return root; }

friend istream &operator >> ( istream &in, BinaryTree<Type> &Tree );
friend ostream &operator << ( ostream &out, BinaryTree <Type> &Tree );

private:
BinTreeNode <Type> *root;
Type RefValue;

// BinTreeNode <Type> * Parent ( BinTreeNode <Type> *start,
// BinTreeNode <Type> *current );
int Insert ( BinTreeNode<Type> * ¤t,
const Type &item );
void Traverse ( BinTreeNode<Type> *current, ostream &out ) const;
int Find ( BinTreeNode<Type> *current, const Type &item ) const ;
void destroy(BinTreeNode<Type> *current);
};

template <class Type> void BinaryTree<Type>::destroy(BinTreeNode<Type> *current)
//私有函数：若指针current不为空，则删除跟为current的子树
{
if(current!=NULL)
{
destroy(current->leftChild);
destroy(current->rightChild);
delete current;
}
}


template<class Type> void BinaryTree<Type>::CreateBiTree(BinTreeNode<Type> *bn)
//输入并建立一颗二叉树Tree
{
Type item;
cin>>item;
if (item=='#') //判断输入是否结束 .RefValue
bn = NULL;
else{
bn = new BinTreeNode<char>();
bn->data = item;
cout<<"*"<<bn->data<<"*"<<endl;
CreateBiTree(bn->rightChild);
CreateBiTree(bn->leftChild);
//cin>>item; //输入
}
return ;
}

template<class Type> void BinaryTree<Type>::Traverse(BinTreeNode<Type> *current,ostream &out) const
//私有函数： 搜索并输出根为current的二叉树
{
if(current!=NULL) //current为空则返回，否则
{
out<<current->data<<' '; //输出current的数据值
Traverse(current->leftChild,out); //搜索并输出current的左子树
Traverse(current->rightChild,out);//搜索并输出current的右子树
}
}

template<class Type> istream& operator >> (istream& in, BinaryTree<Type> &Tree)
//重载操作：输入并建立一颗二叉树Tree. in是输入流对象
{
cout<<"Constructing binary tree: \n"<<"input end sign: "; //打印标题：构造二叉树
// cin>>item;
Tree.RefValue = '#';//item;
cout<<"Input data (end with "<<Tree.RefValue<<" ):"; //提示：输入数据

Tree.CreateBiTree(Tree.root);

return in;
}

template<class Type> ostream& operator << (ostream& out,BinaryTree<Type> &Tree)
//重载操作：输出一颗二叉树Tree. out是输出流对象
{
cout<<"Preorder traversal of binary tree: \n";
Tree.Traverse(Tree.root,out);
out<<endl;
return out;
}


int main()
{
BinaryTree<char> bt;
cin>>bt;
cout<<bt;
return 0;
}