void init(void)
{
glClearColor(1.0,1.0,1.0,0.0);
glMatrixMode(GL_PROJECTION);
gluOrtho2D(0.0,200.0,0.0,150.0);
}
void lineSegment(void)
{
glClear(GL_COLOR_BUFFER_BIT);
glColor3f(1.0,0.0,0.0);
glBegin (GL_LINES);
glVertex2i(180,15);
glVertex2i(10,145);
glEnd();
glFlush();
}
void main(int argc,char**argv)
{
glutInit(&argc,argv);
glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);
glutInitWindowPosition(50,100);
glutInitWindowSize(400,300);
glutCreateWindow("An Example OpenGL Program");
init();
glutDisplayFunc(lineSegment);
glutMainLoop();
}
struct BTreeNode{
ElemType data;
BTreeNode* left;
BTreeNode* right;
};
void InitBTree(BTreeNode* &BT)
{
BT=NULL;
}
void CreateBTree(BTreeNode* &BT,char* a)
{
BTreeNode* s[10];
int top=-1;
BT=NULL;
BTreeNode *p;
int k;
istrstream ins(a);
char ch;
ins >>ch;
while(ch!='@')
{
switch(ch)
{
case '(':
top++;s[top]=p;k=1;
break;
case')':
top--;
break;
case',':
k=2;
break;
default:
p=new BTreeNode;
p->data=ch;p->left=p->right=NULL;
if(BT==NULL)
BT=p;
else{
switch(k)
{
case 1:
s[top]->left=p;
break;
case 2:
s[top]->right=p;
}
}
}
ins>>ch;
}
}
int BTreeEmpty(BTreeNode* BT)
{
return BT==NULL;
}
void Preorder(BTreeNode* BT)//前序遍歷
{
if(BT!=NULL){
cout<<BT->data<<' ';
Preorder(BT->left);
Preorder(BT->right);
}
}
void Inorder(BTreeNode* BT)//中序遍歷
{
if(BT!=NULL){
Inorder(BT->left);
cout<<BT->data<<' ';
Inorder(BT->right);
}
}
void Postorder(BTreeNode* BT)//後序遍歷
{
if(BT!=NULL){
Postorder(BT->left);
Postorder(BT->right);
cout<<BT->data<<' ';
}
}
void Levelorder(BTreeNode* BT)
{
BTreeNode* q[30];
int front=0,rear=0;
BTreeNode* p;
if(BT!=NULL){
rear=(rear+1)%30;
q[rear]=BT;
}
while(front!=rear)
{
front=(front+1)%30;
p=q[front];
cout<<p->data<<' ';
if(p->left!=NULL){
rear=(rear+1)%30;
q[rear]=p->left;
}
if(p->right!=NULL)
{
rear=(rear+1)%30;
q[rear]=p->right;
}
}
}
BTreeDepth(BTreeNode* BT)
{
if(BT==NULL)
return 0;
else
{
int dep1=BTreeDepth(BT->left);
int dep2=BTreeDepth(BT->right);
if(dep1>dep2)
return dep1+1;
else
return dep2+1;
}
}
void PrintBTree(BTreeNode* BT)
{
if(BT!=NULL)
{
cout<<BT->data;
if(BT->left!=NULL||BT->right!=NULL)
{
cout<<'(';
PrintBTree(BT->left);
if(BT->right!=NULL)
cout<<',';
PrintBTree(BT->right);
cout<<')';
}
}
}
void DeleteBTree(BTreeNode* BT)
{
if(BT!=NULL)
{
DeleteBTree(BT->left);
DeleteBTree(BT->right);
delete BT;
}
}
void ClearBTree(BTreeNode* &BT)
{
DeleteBTree(BT);
BT=NULL;
}
//以下是源文件部分
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
#include<strstrea.h>
typedef char ElemType;
#include"BTree.h"
void main()
{
BTreeNode* bt;
InitBTree(bt);
char b[50];
cout<<"輸入以'@'字符作爲結束符的二叉樹廣義表表示:"<<endl;
cin.getline(b,sizeof(b));
CreateBTree(bt,b);
PrintBTree(bt);
cout<<endl;
cout<<"前序:";
Preorder(bt);cout<<endl;
cout<<"中序:";
Inorder(bt);cout<<endl;
cout<<"後序:";
Postorder(bt);cout<<endl;
cout<<"按層:";
Levelorder(bt);cout<<endl;
cout<<"二叉樹的深度爲:";
cout<<BTreeDepth(bt)<<endl;
ClearBTree(bt);
getch();
}
34409541 討論網頁
34409326 討論JAVA 已滿
34408784 討論VC++
34409699 討論VC++
9143041 討論MFC編程
10614204 討論C#
10613030 討論Win32編程
10613067 討論遊戲開發
18779860 討論JAVA
*/