Vc 实现二叉树遍历,学生成绩管理系统,调用系统程序,对 学生成绩冒泡排序,选择排序 等代码,能运行 二叉树 #include "stdafx.h" #include
struct BinTreeNode { char data; struct BinTreeNode *left,*right; }; class BinTree { public: BinTreeNode *root; void BinTree::PreOrder(BinTreeNode *t)
{ if(t!=NULL&;&;t->data!='\0'){ cout<data<<" "; PreOrder(t->left); PreOrder(t->right);
} } void BinTree::InOrder(BinTreeNode *t)
{ if(t!=NULL&;&;t->data!='\0'){ InOrder(t->left); cout<data<<" "; InOrder(t->right); } } void BinTree::PostOrder(BinTreeNode *t)
{ if(t!=NULL&;&;t->data!='\0'){ PostOrder(t->left); PostOrder(t->right); cout<data<<" "; } }
};
int main() { BinTree k; char ch[30]; cout<<"请输入需要转换的字符串:"; cin>>ch; int i=0; int j=0; BinTreeNode *s ,*root; BinTreeNode *q[100]; while (ch[i]!='\0') { if (ch[i]=='#') i++; else { s=new BinTreeNode; s->data=ch[i]; s->left=NULL; s->right=NULL; j=i+1; if (i==0) {
root=s; } else{ if (q[j/2]!=NULL) { if (j%2==0) q[j/2]->left=s; else q[j/2]->right=s;
} } q[j]=s; i++; } } cout<<"Fine!"< cout< }; 二叉树生成与遍历 二叉树生成与遍历完整代码: // Exec.cpp : Defines the entry point for the console application. //
#include "stdafx.h" #include
struct BinTreeNode { public: char data; BinTreeNode *left,*right; };
void pre(BinTreeNode *ppp){ if(ppp!=NULL&;&;ppp->data!='\0'){ cout<data<<" ";
pre(ppp->left); pre(ppp->right); } } void mid(BinTreeNode *ppp){ if(ppp!=NULL&;&;ppp->data!='\0'){ mid(ppp->left); cout<data<<" "; mid(ppp->right); } } void post(BinTreeNode *ppp){ if(ppp!=NULL&;&;ppp->data!='\0'){ post(ppp->left); post(ppp->right); cout<data<<" "; } }
int main(int argc, char* argv[]) { printf("Hello World!\n");
char ch[100]; cout<<"请输入二叉树的完整字符串序列 (例如: ABCD#EF) : "; cin>>ch; BinTreeNode *q[100]; BinTreeNode *s,*root; for(int j=0;j<100;j++) q[j]=NULL; int i=0; while(ch[i]!='\0'){ if(ch[i]=='#') i++; else { s=new BinTreeNode; s->data=ch[i]; s->left=NULL; s->right=NULL; j=i+1; if(i==0) root=s; else{ if (q[j/2]!=NULL){ if(j%2==0) q[j/2]->left=s; else q[j/2]->right=s; }
} q[j]=s; i++; } } cout<<"Fine!"<管理系统
#include "stdafx.h" #include #include
struct Student { char id[10]; char name[10]; char sex[10]; char grade[10]; char tel[20]; char age[10]; }; class SeqList { public: Student data[20]; int length; SeqList(){ length=0;} bool IsListEmpty(){return length==0;}
void ListDelete(char ID[]) { int j=0; for(int i=0;i { if(str
cmp(data[i].id,ID)==0) j=i+1; } if(j==0) else{ for(int k=j;k<=length-1;k++) {data[j-1]=data[j];} } length--; }; cout<<"没有该学生的信息!"< void ListInsert(Student x) { for(int i=length-1;i>=0;i--) data[i+1]=data[i]; data[0]=x; length++; };
void Showall() { for(int d=0;d };
int main(int argc, char* argv[]) { int n; printf("Hello World!\n"); SeqList Q; while(n!=0) { cout<<"1——信息浏览"< cout<<"3——删除信息"<>n; switch(n) { case 1: cout<<"数据库中没有信息"<xml:namespace prefix = endl; Q.Showall(); break; case 2 />
#include struct Stud